Spatio%2Dtemporal patterns in network events.

The Art of Classroom Teaching in the Context of General Computer Science Education.

A study on the relationship between management structure and financial reporting fraud of listed companies in China.

Efficient indexing structure for scalable processing of spatial alarms.
Spatial Alarms are reminders for mobile users upon their arrival of certain spatial location of interest. Spatial alarm processing requires meeting two demanding objectives: high accuracy, which ensures zero or very low alarm misses, and high scalability, which requires highly efficient and optimal processing of spatial alarms. Existing techniques for processing spatial alarms cannot solve these two problems at the same time. In this paper we present the design and implementation of a new indexing technique, Mondrian tree. The Mondrian tree indexing method partitions the entire universe of discourse into spatial alarm monitoring regions and alarm-free regions. This enables us to reduce the number of on-demand alarm-free region computations, significant saving of both server load and client to server communication cost. We evaluate the efficiency of the Mondrian tree indexing approach using a road network simulator and show that the Mondrian tree offers significant performance enhancements on spatial alarm processing at both the server side and the client side. 1.
Precise SAR satellite orbit parameters determination based on Ground Control Points.

XColor Protecting general proximity privacy.
Abstract — As a severe threat in anonymized data publication, proximity breach is gaining increasing attention. Such breach occurs when an attacker learns with high confidence that the sensitive information of a victim associates with a set of semantically proximate values, even though not sure about the exact one. Recently (ɛ, δ)-dissimilarity [14] has been proposed as an effective countermeasure against general proximity attack. In this paper, we present a detailed analytical study on the fulfillment of this principle, derive criteria to efficiently test its satisfiability for given microdata, and point to a novel anonymization model, XCOLOR, with theoretical guarantees on both operation efficiency and utility preservation. I.
Monitoring continuous state violation in datacenters Exploring the time dimension.
Abstract — Monitoring global states of an application deployed over distributed nodes becomes prevalent in today’s datacenters. State monitoring requires not only correct monitoring results but also minimum communication cost for efficiency and scalability. Most existing work adopts an instantaneous state monitoring approach, which triggers state alerts whenever a constraint is violated. Such an approach, however, may cause frequent and unnecessary state alerts due to unpredictable monitored value bursts and momentary outliers that are common in large-scale Internet applications. These false alerts may further lead to expensive and problematic counter-measures. To address this issue, we introduce window-based state monitoring in this paper. Window-based state monitoring evaluates whether state violation is continuous within a time window, and thus, gains immunity to short-term value bursts and outliers. Furthermore, we find that exploring the monitoring time window at distributed nodes achieves significant communication savings over instantaneous monitoring. Based on this finding, we develop WISE, a system that efficiently performs WIndow-based StatE monitoring at datacenter-scale. WISE is highlighted with three sets of techniques. First, WISE uses distributed filtering time windows and intelligently avoids global information collecting to achieve communication efficiency, while guaranteeing monitoring correctness at the same time. Second, WISE provides a suite of performance tuning techniques to minimize communication cost based on a sophisticated cost model. Third, WISE also employs a set of novel performance optimization techniques. Extensive experiments over both real world and synthetic traces show that WISE achieves a 50%-90 % reduction in communication cost compared with existing instantaneous monitoring approaches and simple alternative schemes. I.
Spatial Integration of Urban Agglomeration Based on DEA Dynamic Clustering.

Spatial Integration of Urban Agglomeration Based on DEA Dynamic Clustering.



On processing location based top%2Dk queries in the wireless broadcasting system.
In this paper, we explore the problem of processing a novel type of location based queries, named the location based top-k query, which involves both of spatial and non-spatial specifications for data objects in the wireless broadcasting system. We introduce two methods for processing location based top-k queries on the broadcast stream. In the first method, the search algorithm runs on the broadcast aggregate R-tree (aR-tree). However, the aR-tree may deteriorate the search performance, especially in terms of the tuning time. With this problem in mind, we propose a novel index structure, called the bit-vector R-tree (bR-tree), which stores additional bit-vector information to facilitate processing of location based top-k queries. The search algorithm on the broadcast bR-tree is also described. Our simulation experiments demonstrate that the bR-tree method clearly outperforms the aR-tree method in terms of the tuning time, while maintaining similar or better performance in terms of the access time.
Evaluation of Collecting Reviews in Centralized Online Reputation Systems.

Constructing New Braided T%2DCategories over Weak Hopf Algebras.

SCALE a scalable framework for efficiently clustering transactional data.
This paper presents SCALE, a fully automated transactional clustering framework. The SCALE design highlights three unique features. First, we introduce the concept of Weighted Coverage Density as a categorical similarity measure for efficient clustering of transactional datasets. The concept of weighted coverage density is intuitive and it allows the weight of each item in a cluster to be changed dynamically according to the occurrences of items. Second, we develop the weighted coverage density measure based clustering algorithm, a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Third, we introduce two clustering validation metrics and show that these domain specific clustering evaluation metrics are critical to capture the transactional semantics in clustering analysis. Our SCALE framework combines the weighted coverage density measure for clustering over a sample dataset with self-configuring methods. These self-configuring methods can automatically tune the two important parameters of our clustering algorithms: (1) the candidates of the best number K of clusters; and (2) the application of two domain-specific cluster validity measures to find the best result from the set of clustering results. We have conducted extensive experimental evaluation using both synthetic and real datasets and our results show that the weighted coverage density approach powered by the SCALE framework can efficiently generate high quality clustering results in a fully automated manner. key words: transactional data clustering, cluster assessment, cluster validation, frequent itemset mining, weighted coverage density

Guest Editorial Special Section on Transactional Web Services.


Execution Assurance for Massive Computing Tasks.

The SocialTrust framework for trusted social information management Architecture and algorithms.

Does sampling influence customers in online retailing of digital music%3F

An Energy Efficient Middleware Architecture for Processing Spatial Alarms on Mobile Clients.
Abstract Time based alarms are used by many on a daily basis. Spatial alarms extend the very same idea to location based triggers, which are fired whenever a mobile user enters the spatial region of the location alarms. Spatial alarms provide critical capabilities for many mobile location based applications ranging from personal assistants, inventory tracking to industrial safety warning systems. In this paper we present a middleware architecture for energy efficient processing of spatial alarms on mobile clients, while maintaining low computation and storage costs. Our approach to spatial alarms provides two systematic methods for minimizing energy consumption on mobile clients. First, we introduce the concept of safe distance to reduce the number of unnecessary mobile client wakeups for spatial alarm evaluation, enabling mobile clients to sleep for longer intervals of time in the presence of active spatial alarms. We show that our safe distance techniques can significantly minimize the energy consumption on mobile clients compared to periodic wakeups while preserving the accuracy and timeliness of spatial alarms. Second, we develop a suite of techniques for minimizing the number of location triggers to be checked for spatial alarm evaluation upon each wakeup. This further reduces the computation cost and energy expenditure on mobile clients. We evaluate the scalability and energyefficiency of our approach using a road network simulator. Our spatial alarms middleware architecture offers
An Energy Efficient Middleware Architecture for Processing Spatial Alarms on Mobile Clients.
Abstract Time based alarms are used by many on a daily basis. Spatial alarms extend the very same idea to location based triggers, which are fired whenever a mobile user enters the spatial region of the location alarms. Spatial alarms provide critical capabilities for many mobile location based applications ranging from personal assistants, inventory tracking to industrial safety warning systems. In this paper we present a middleware architecture for energy efficient processing of spatial alarms on mobile clients, while maintaining low computation and storage costs. Our approach to spatial alarms provides two systematic methods for minimizing energy consumption on mobile clients. First, we introduce the concept of safe distance to reduce the number of unnecessary mobile client wakeups for spatial alarm evaluation, enabling mobile clients to sleep for longer intervals of time in the presence of active spatial alarms. We show that our safe distance techniques can significantly minimize the energy consumption on mobile clients compared to periodic wakeups while preserving the accuracy and timeliness of spatial alarms. Second, we develop a suite of techniques for minimizing the number of location triggers to be checked for spatial alarm evaluation upon each wakeup. This further reduces the computation cost and energy expenditure on mobile clients. We evaluate the scalability and energyefficiency of our approach using a road network simulator. Our spatial alarms middleware architecture offers
RoadTrack Scaling Location Updates for Mobile Clients on Road Networks with Query Awareness.

Encyclopedia of Database Systems

Unified analytical models for Location Management costs and optimum design of location areas.

A Systematic Approach to System State Restoration during Storage Controller Micro%2DRecovery.
Micro-recovery, or failure recovery at a fine granularity, is a promising approach to improve the recovery time of software for modern storage systems. Instead of stalling the whole system during failure recovery, micro-recovery can facilitate recovery by a single thread while the system continues to run. A key challenge in performing micro-recovery is to be able to perform efficient and effective state restoration while accounting for dynamic dependencies between multiple threads in a highly concurrent environment. We present Log(Lock), a practical and flexible architecture for performing state restoration without re-architecting legacy code. We formally model thread dependencies based on accesses to both shared state and resources. The Log(Lock) execution model tracks dependencies at runtime and captures the failure context through the restoration level. We develop restoration protocols based on recovery points and restoration levels that identify when micro-recovery is possible and the recovery actions that need to be performed for a given failure context. We have implemented Log(Lock) in a real enterprise storage controller. Our experimental evaluation shows that Log(Lock)-enabled micro-recovery is efficient. It imposes &lt; 10 % overhead on normal performance and &lt;35 % overhead during actual recovery. However, the 35 % performance overhead observed during recovery lasts only six seconds and replaces the four seconds of downtime that would result from a system restart. 1
A Systematic Approach to System State Restoration during Storage Controller Micro%2DRecovery.
Micro-recovery, or failure recovery at a fine granularity, is a promising approach to improve the recovery time of software for modern storage systems. Instead of stalling the whole system during failure recovery, micro-recovery can facilitate recovery by a single thread while the system continues to run. A key challenge in performing micro-recovery is to be able to perform efficient and effective state restoration while accounting for dynamic dependencies between multiple threads in a highly concurrent environment. We present Log(Lock), a practical and flexible architecture for performing state restoration without re-architecting legacy code. We formally model thread dependencies based on accesses to both shared state and resources. The Log(Lock) execution model tracks dependencies at runtime and captures the failure context through the restoration level. We develop restoration protocols based on recovery points and restoration levels that identify when micro-recovery is possible and the recovery actions that need to be performed for a given failure context. We have implemented Log(Lock) in a real enterprise storage controller. Our experimental evaluation shows that Log(Lock)-enabled micro-recovery is efficient. It imposes &lt; 10 % overhead on normal performance and &lt;35 % overhead during actual recovery. However, the 35 % performance overhead observed during recovery lasts only six seconds and replaces the four seconds of downtime that would result from a system restart. 1
REMO Resource%2DAware Application State Monitoring for Large%2DScale Distributed Systems.
To observe, analyze and control large scale distributed systems and the applications hosted on them, there is an increasing need to continuously monitor performance attributes of distributed system and application states. This results in application state monitoring tasks that require finegrained attribute information to be collected from relevant nodes efficiently. Existing approaches either treat multiple application state monitoring tasks independently and build ad-hoc monitoring trees for each task, or construct a single static monitoring tree for multiple tasks. We argue that a careful planning of multiple application state monitoring tasks by jointly considering multi-task optimization and node level resource constraints can provide significant gains in performance and scalability. In this paper, we present REMO, a REsource-aware application state MOnitoring system. REMO produces a forest of optimized monitoring trees through iterations of two phases, one phase exploring cost sharing opportunities via estimation and the other refining the monitoring plan through resource-sensitive tree construction. Our experimental results include those gathered by deploying REMO on a BlueGene/P rack running IBM’s large-scale distributed streaming system- System S. Using REMO in the context of running over 200 monitoring tasks for an application deployed across 200 nodes results in a 35%-45 % decrease in the percentage error of collected attributes compared to existing schemes. 1.
A General Proximity Privacy Principle.
Recent years have witnessed ever-increasing concerns about individual privacy in numerous data dissemination applications that involve private personal information, e.g., medical data or census data. Typically, such microdata is stored in a relational
DHT%2DBased Range Query Processing for Web Service Discovery.
DHTs are scalable, self-organizing, and adaptive to underlying topology changes, thus being a promising infrastructure for realizing efficient Web service discovery. Range queries play an important role in service discovery, and in recent years a number of DHTbased range query schemes have been proposed. However, most of them suffer from high query delay and high processing cost. This paper presents ERQ, an Efficient scheme for delay-bounded Range Query processing over DHTs. We first design a balanced Kautz (BK) tree to uniformly map the m-dimensional data space onto DHT nodes, and then present a novel algorithm that processes range queries in a parallel fashion, where an on-the-fly space pruning mechanism is adopted to reduce the processing cost. In a DHT with N nodes, ERQ can answer any multi-attribute range query in less than logN(2loglogN+1) hops with low processing cost, irrespective of the queried range, the whole space size, or the number of queried attributes. The effectiveness of ERQ is demonstrated through extensive experiments. 1.
Scalable and Reliable Location Services through Decentralized Replication.
Abstract—One of the critical challenges for service oriented computing systems is the capability to guarantee scalable and reliable service provision. This paper presents Reliable GeoGrid, a decentralized service computing architecture based on geographical location aware overlay network for supporting reliable and scalable mobile information delivery services. The reliable GeoGrid approach offers two distinct features. First, we develop a distributed replication scheme, aiming at providing scalable and reliable processing of location service requests in decentralized pervasive computing environments. Our replica management operates on a network of heterogeneous nodes and utilizes a shortcut-based optimization to increase the resilience of the system against node failures and network failures. Second, we devise a dynamic load balancing technique that exploits the service processing capabilities of replicas to scale the system in anticipation of unexpected workload changes and node failures by taking into account of node heterogeneity, network proximity, and changing workload at each node. Our experimental evaluation shows that the reliable GeoGrid architecture is highly scalable under changing service workloads with moving hotspots and highly reliable in the presence of both individual node failures and massive node failures. I.
Privacy in VoIP Networks A k%2DAnonymity Approach.

Learning%2C indexing%2C and diagnosing network faults.
Modern communication networks generate massive volume of operational event data, e.g., alarm, alert, and metrics, which can be used by a network management system (NMS) to diagnose potential faults. In this work, we introduce a new class of indexable fault signatures that encode temporal evolution of events generated by a network fault as well as topological relationships among the nodes where these events occur. We present an efficient learning algorithm to extract such fault signatures from noisy historical event data, and with the help of novel space-time indexing structures, we show how to perform efficient, online signature matching. We provide results from extensive experimental studies to explore the efficacy of our approach and point out potential applications of such signatures for many different types of networks including social and information networks.
Determining the best K.

Experimental Verification of a Four%2DDimensional Chua%27s System and its fractional Order Chaotic attractors.

A Parameterized Approach to Spam%2DResilient Link Analysis of the Web.



Privacy%2DPreserving Multiparty Collaborative Mining with Geometric Data Perturbation.
Abstract—In multiparty collaborative data mining, participants contribute their own datasets and hope to collaboratively mine a comprehensive model based on the pooled dataset. How to efficiently mine a quality model without breaching each party’s privacy is the major challenge. In this paper, we propose an approach based on geometric data perturbation and datamining-service oriented framework. The key problem of applying geometric data perturbation in multiparty collaborative mining is to securely unify multiple geometric perturbations that are preferred by different parties, respectively. We have developed three protocols for perturbation unification. Our approach has three unique features compared to the existing approaches. (1) With geometric data perturbation, these protocols can work for many existing popular data mining algorithms, while most of other approaches are only designed for a particular mining algorithm. (2) Both the two major factors: data utility and privacy guarantee are well preserved, compared to other perturbationbased approaches. (3) Two of the three proposed protocols also have great scalability in terms of the number of participants, while many existing cryptographic approaches consider only two or a few more participants. We also study different features of the three protocols and show the advantages of different protocols in experiments. Index Terms—privacy preserving data mining, distributed computing, collaborative computing, geometric data perturbation I.
Mitigating Denial%2Dof%2DService Attacks on the Chord Overlay Network A Location Hiding Approach.
Abstract—Serverless distributed computing has received significant attention from both the industry and the research community. Among the most popular applications are the wide-area network file systems, exemplified by CFS, Farsite, and OceanStore. These file systems store files on a large collection of untrusted nodes that form an overlay network. They use cryptographic techniques to maintain file confidentiality and integrity from malicious nodes. Unfortunately, cryptographic techniques cannot protect a file holder from a denial-of-service (DoS) attack or a host compromise attack. Hence, most of these distributed file systems are vulnerable to targeted file attacks, wherein an adversary attempts to attack a small (chosen) set of files by attacking the nodes that host them. This paper presents LocationGuard—a location hiding technique for securing overlay file storage systems from targeted file attacks. LocationGuard has three essential components: 1) location key, consisting of a random bit string (e.g., 128 bits) that serves as the key to the location of a file, 2) routing guard, a secure algorithm that protects accesses to a file in the overlay network given its location key such that neither its key nor its location is revealed to an adversary, and 3) a set of location inference guards, which refer to an extensible component of the LocationGuard. Our experimental results quantify the overhead of employing LocationGuard and demonstrate its effectiveness against DoS attacks, host compromise attacks, and various location inference attacks. Index Terms—File systems, overlay networks, denial-of-service attacks, performance and scalability, location hiding. Ç
%22Best K%22 critical clustering structures in categorical datasets.
Abstract- This paper deals with a new class of convolutional codes called Turbo-codes, whose performances in terms of Bit Error Rate (BER) are close to the SHANNON limit. The Turbo-Code encoder is built using a parallel concatenation of two Recursive Systematic Convolutional codes and the associated decoder, using a feedback decoding rule, is implemented as P pipelined identical elementary decoders. Consider a binary rate R=1/2 convolutional encoder with constraint length K and memory M=K-1. The input to the encoder at time k is a bit dk and the corresponding codeword
Scalable key management algorithms for location%2Dbased services.

%22Best K%22 critical clustering structures in categorical datasets.
Abstract- This paper deals with a new class of convolutional codes called Turbo-codes, whose performances in terms of Bit Error Rate (BER) are close to the SHANNON limit. The Turbo-Code encoder is built using a parallel concatenation of two Recursive Systematic Convolutional codes and the associated decoder, using a feedback decoding rule, is implemented as P pipelined identical elementary decoders. Consider a binary rate R=1/2 convolutional encoder with constraint length K and memory M=K-1. The input to the encoder at time k is a bit dk and the corresponding codeword


Privacy and location anonymization in location%2Dbased services.
(ACM) Special Interest Group on Spatial Information (SIGSPATIAL). ACM SIGSPATIAL addresses issues related to the acquisition, management, and processing of spatially-related information with a focus on algorithmic, geometric, and visual considerations. The scope includes, but is not limited to, geographic information systems. Current ACM SIGSPATIAL officers are:
Search%2Das%2Da%2Dservice Outsourced search over outsourced storage.

HE%2DTree a framework for detecting changes in clustering structure for categorical data streams.
Analyzing clustering structures in data streams can provide critical information for real-time decision making. Most research in this area has focused on clustering algorithms for numerical data streams, and very few have proposed to monitor the change of clustering structure. Most surprisingly, to our knowledge, no work has been proposed on monitoring clustering structure for categorical data streams. In this paper, we present a framework for detecting the change of primary clustering structure in categorical data streams, which is indicated by the change of the best number of clusters (Best K) in the data stream. The framework uses a Hierarchical Entropy Tree structure (HE-Tree) to capture the entropy characteristics of clusters in a data stream, and detects the change of Best K by combining our previously developed BKPlot method. The HE-Tree can efficiently summarize the entropy property of a categorical data stream and allow us to draw precise clustering information from the data stream for generating high-quality BKPlots. We also develop the time-decaying HE-Tree structure to make the monitoring more sensitive to recent changes of clustering structure. The experimental result shows that with the combination of the HE-Tree and the BKPlot method we are able to promptly and precisely detect the change of clustering structure in categorical data streams.
Query%2DURL Bipartite Based Approach to Personalized Query Recommendation.
Query recommendation is considered an effective assistant in enhancing keyword based queries in search engines and Web search software. Conventional approach to query recommendation has been focused on query-term based analysis over the user access logs. In this paper, we argue that utilizing the connectivity of a query-URL bipartite graph to recommend relevant queries can significantly improve the accuracy and effectiveness of the conventional query-term based query recommendation systems. We refer to the Query-URL Bipartite based query reCommendation approach as QUBIC. The QUBIC approach has two unique characteristics. First, instead of operating on the original bipartite graph directly using biclique based approach or graph clustering, we extract an affinity graph of queries from the initial query-URL bipartite graph. The affinity graph consists of only queries as its vertices and its edges are weighted according to a query-URL vector based similarity (distance) measure. By utilizing the query affinity graph, we are able to capture the propagation of similarity from query to query by inducing an implicit topical relatedness between queries. We devise a novel rank mechanism for ordering the related queries based on the merging distances of a hierarchical agglomerative clustering. We compare our proposed ranking algorithm with both naïve ranking that uses the query-URL similarity measure directly, and the single-linkage based ranking method. In addition, we make it possible for users to interactively participate in the query recommendation process, to bridge the gap between the determinacy of actual similarity values and the indeterminacy of users ’ information needs, allowing the lists of related queries to be changed from user to user and query to query, thus personalizing the query recommendation on demand. The experimental results from two query collections demonstrate the effectiveness and feasibility of our approach. 1.
Enhancing Storage System Availability on Multi%2DCore Architectures with Recovery%2DConscious Scheduling.
In this paper we develop a recovery conscious framework for multi-core architectures and a suite of techniques for improving the resiliency and recovery efficiency of highly concurrent embedded storage software systems. Our techniques aim at providing continuous availability and performance during recovery while minimizing the time to recovery and the need for rearchitecting the system (legacy code). The main contributions of our recovery conscious framework include (1) a task-level recovery model, which consists of mechanisms for classifying storage tasks into recovery groups and dividing the overall system resources into recovery-oriented resource pools, and (2) the development of recovery-conscious scheduling, which enforces some serializability of failuredependent tasks in order to reduce the ripple effect of software failure and improve the availability of the system. We present three alternative recoveryconscious scheduling algorithms; each represents one way to trade-off between recovery time and system performance. We have implemented and evaluated these recovery-conscious scheduling algorithms on a real industry-standard storage system. Our experimental evaluation results show that the proposed recovery conscious scheduling algorithms are nonintrusive and can significantly improve (throughput by 16.3 % and response time by 22.9%) the performance of the system during failure recovery. 1
Assessment Model Based on Markov Chain.


Scalable Processing of Spatial Alarms.
Spatial alarms extend the idea of time-based alarms to the spatial dimension. Just as time-based alarms are set to remind us of the arrival of a future reference time point, spatial alarms are set on a spatial location of interest which the subscribers of the alarm will travel to sometime in the future. Spatial alarm processing requires meeting two demanding objectives: high accuracy, which ensures zero or very low alarm misses, and high scalability, which requires highly efficient and optimal processing of spatial alarms. In this paper we present a motion-aware framework, facilitated by two systematic methods, for scalable processing of spatial alarms. First, we introduce the concept of safe period to minimize the number of unnecessary spatial alarm evaluations, increasing the throughput and scalability of the system. We show that our safe period-based alarm evaluation techniques can significantly reduce the server load for spatial alarm processing compared to the periodic evaluation approach, while preserving the accuracy and timeliness of spatial alarms. Second, we develop a suite of spatial alarm grouping techniques based on spatial locality of the alarms and motion behavior of the mobile users, which reduces the safe period computation cost for spatial alarm evaluation at the server side. We evaluate the scalability and accuracy of our approach using a road network simulator and show that the proposed motion-aware safe period-based approach to spatial alarm processing offers significant performance enhancements for the alarm processing server while maintaining high accuracy of spatial alarms, especially compared to the conventional periodic alarm evaluation approach. 1.

MobiQual QoS%2Daware Load Shedding in Mobile CQ Systems.
Abstract — Freshness and accuracy are two key measures of quality of service (QoS) in location-based, mobile continual queries (CQs). However, it is often difficult to provide both fresh and accurate CQ results due to (a) limited resources in computing and communication and (b) fast-changing load conditions caused by continuous mobile node movement. Thus a key challenge for a mobile CQ system is: How do we achieve the highest possible quality of the query results, in both freshness and accuracy, with currently available resources under changing load conditions? In this paper, we formulate this problem as a load shedding one, and develop MobiQual−aQoS-aware framework for performing both update load shedding and query load shedding. The design of MobiQual highlights three important features. (1) Differentiated load shedding: Different amounts of query and update load shedding are applied to different groups of queries and mobile nodes, respectively. (2) Per-query QoS specifications: The overall freshness and accuracy of the query results are maximized with individualized QoS specifications. (3) Low-cost adaptation: MobiQual dynamically adapts, with a minimal overhead, to changing load conditions and available resources. We show that, through a careful combination of update and query load shedding, the MobiQual approach leads to much higher freshness and accuracy in the query results in all cases, compared to existing approaches. I.
Butterfly Protecting Output Privacy in Stream Mining.
Abstract — Privacy preservation in data mining demands protecting both input and output privacy. The former refers to sanitizing the raw data itself before performing mining. The latter refers to preventing the mining output (model/pattern) from malicious pattern-based inference attacks. The preservation of input privacy does not necessarily lead to that of output privacy. This work studies the problem of protecting output privacy in the context of frequent pattern mining over data streams. After exposing the privacy breaches existing in current stream mining systems, we propose Butterfly, a light-weighted countermeasure that can effectively eliminate these breaches without explicitly detecting them, meanwhile minimizing the loss of the output accuracy. We further optimize the basic scheme by taking account of two types of semantic constraints, aiming at maximally preserving utility-related semantics while maintaining the hard privacy and accuracy guarantee. We conduct extensive experiments over reallife datasets to show the effectiveness and efficiency of our approach. I.
Sharoes A Data Sharing Platform for Outsourced Enterprise Storage Environments.
Abstract — With fast paced growth of digital data and exploding storage management costs, enterprises are looking for new ways to effectively manage their data. One such cost-effective paradigm is the Storage-as-a-Service model, in which enterprises outsource their storage to a storage service provider (SSP) by storing data at a remote SSP-managed site and accessing it over a high speed network. Often for a variety of reasons, enterprises find it unacceptable to fully trust the SSP and prefer to store data in an encrypted form. This typically limits collaboration and data sharing among enterprise users due to complex key management and access control challenges. In this paper, we propose a platform called SHAROES that provides data sharing capability over such outsourced storage environments. SHAROES provide rich *nix-like data sharing semantics over SSP stored data, without trusting the SSP for data confidentiality or access control. SHAROES is unique in its ability in reducing user involvement during setup and operation through the use of in-band key management and allows a near-seamless transition of existing storage environments to the new model. It is also superior in performance by minimizing the use of expensive public-key cryptography in metadata management. We present the architecture and implementation of various SHAROES components and our experiments demonstrate performance superior to other proposals by over 40 % on a number of benchmarks. I.
A Temporal Data%2DMining Approach for Discovering End%2Dto%2DEnd Transaction Flows.
Effective management of Web Services systems relies on accurate understanding of end-to-end transaction flows, which may change over time as the service composition evolves. This work takes a data mining approach to automatically recovering end-to-end transaction flows from (potentially obscure) monitoring events produced by monitoring tools. We classify the caller-callee relationships among monitoring events into three categories (identity, direct-invoke, and cascaded-invoke), and propose unsupervised learning algorithms to generate rules for each type of relationship. The key idea is to leverage the temporal information available in the monitoring data and extract patterns that have statistical significance. By piecing together the caller-callee relationships at each step along the invocation path, we can recover the end-to-end flow for every executed transaction. Experiments demonstrate that our algorithms outperform human experts in terms of solution quality, scale well with the data size, and are robust against noises in monitoring data.
Scaling Location%2Dbased Services with Dynamically Composed Location Index.
Performance and scalability of location-based services (LBSs) are crucial to the wide deployment of mobile enterprise systems. Location queries are a fundamental capability of LBSs. Conventional approaches to location query processing have been centered on an object-centric architecture where static and moving objects are processed under a unified framework through an object index or query index. In this paper, we identify and exploit the performance benefit of a location-centric framework by promoting a clean separation of location query processing over static objects from query processing over moving objects. We show the performance benefits of treating locations as first class citizens instead of objects. Concretely, we develop a federated location indexing scheme for processing location queries over static objects and maintain a grid-based object index for processing queries over moving objects. Our experimental results demonstrate that the location-centric framework enables highly efficient processing of different types of location queries in a mobile environment, prevails under all types of query workloads compared to the object-centric approaches, and in some scenarios it requires as low as only 6 % of the IOs required by a corresponding object index for query evaluation. 1
Hierarchical Business Process Clustering.

Preserving Caller Anonymity in Voice%2Dover%2DIP Networks.
Abstract — Applications such as VoIP need to provide anonymity to clients while maintaining low latency to satisfy quality of service (QoS) requirements. Existing solutions for providing anonymity such as mix networks are not well suited to applications like VoIP, SSH, and gaming which require low communication latency. This paper investigates the problem of on-demand construction of QoS sensitive routes on anonymizing networks using the VoIP application. We first describe triangulation based timing analysis attacks on shortest path route set up protocols. We show that even when a small fraction (∼1%) of the network is malicious, the adversary can infer the source (caller) with reasonably high probability. Second, we describe random walk based route set up protocols that significantly improve anonymity while satisfying latencybased QoS guarantees. We describe a prototype implementation of our proposal and show that our protocols can significantly reduce the probability of inferring the caller. We present a detailed experimental evaluation to demonstrate our attacks and quantify the performance and scalability of our guards. I.
A Scalable Method for Access Control in Location%2DBased Broadcast Services.
Abstract. One important problem for such public broadcast LBS is to enforce access control on a large number of subscribers. In such a system a user typically subscribes to a LBS for a time interval (a, b) and a spatial region (xbl, ybl, xtr, ytr) according to a 3-dimensional spatial-temporal authorization model. In this paper, we argue that current approaches to access control using group key management protocols are not scalable. Our proposal STauth minimizes the number of keys which needs to be distributed and is thus scalable to a much higher number of subscribers and the dimensionality of the authorization model. We analytically and experimentally demonstrate the performance and scalability benefits of our approach against other group key management protocols. 1
Socialtrust tamper%2Dresilient trust establishment in online communities.
Web 2.0 promises rich opportunities for information sharing, electronic commerce, and new modes of social interaction, all centered around the“social Web”of user-contributed content, social annotations, and person-to-person social connections. But the increasing reliance on this “social Web ” also places individuals and their computer systems at risk, creating opportunities for malicious participants to exploit the tight social fabric of these networks. With these problems in mind, we propose the SocialTrust framework for tamperresilient trust establishment in online communities. Social-Trust provides community users with dynamic trust values by (i) distinguishing relationship quality from trust; (ii) incorporating a personalized feedback mechanism for adapting as the community evolves; and (iii) tracking user behavior. We experimentally evaluate the SocialTrust framework using real online social networking data consisting of millions of MySpace profiles and relationships. We find that SocialTrust supports robust trust establishment even in the presence of large-scale collusion by malicious participants.
Socialtrust tamper%2Dresilient trust establishment in online communities.
Web 2.0 promises rich opportunities for information sharing, electronic commerce, and new modes of social interaction, all centered around the“social Web”of user-contributed content, social annotations, and person-to-person social connections. But the increasing reliance on this “social Web ” also places individuals and their computer systems at risk, creating opportunities for malicious participants to exploit the tight social fabric of these networks. With these problems in mind, we propose the SocialTrust framework for tamperresilient trust establishment in online communities. Social-Trust provides community users with dynamic trust values by (i) distinguishing relationship quality from trust; (ii) incorporating a personalized feedback mechanism for adapting as the community evolves; and (iii) tracking user behavior. We experimentally evaluate the SocialTrust framework using real online social networking data consisting of millions of MySpace profiles and relationships. We find that SocialTrust supports robust trust establishment even in the presence of large-scale collusion by malicious participants.
CoopIS 2008 PC Co%2Dchairs%27 Message.

Energy%2DEfficient Processing of Spatial Alarms on Mobile Clients.
In this paper we present an energy efficient framework for processing spatial alarms on mobile clients, while maintaining low computation and storage costs. Our approach to spatial alarms provides two systematic methods for minimizing energy consumption on mobile clients. First, we introduce the concept of safe distance to reduce the number of unnecessary mobile client wakeups for spatial alarm evaluation. This mechanism not only reduces the amount of unnecessary processing of the spatial alarms but also significantly minimizes the energy consumption on mobile clients, compared to periodic wakeups, while preserving the accuracy and timeliness of the spatial alarms. Second, we develop a suite of techniques for minimizing the number of location triggers to be checked for spatial alarm evaluation upon each wakeup. This further reduces the computation cost and energy expenditure on mobile clients. We evaluate the scalability and energy-efficiency of our approach using a road network simulator. Our client based framework for spatial alarms offers significant improvements on both system performance and battery lifetime of mobile clients, while maintaining high quality of spatial alarm services, especially compared to the conventional approach of periodic wakeup and checking all alarms upon wakeup. 1
Grouping Distributed Stream Query Services by Operator Similarity and Network Locality.
Distributed stream query services must simultaneously process a large number of complex, continuous queries with stringent performance requirements while utilizing distributed processing resources. In this paper we present the design and evaluation of a distributed stream query service that achieves massive scalability, a key design principle for such systems, by taking advantage of the opportunity to reuse the same distributed operator for multiple and different concurrent queries. We present concrete techniques that utilize the well-defined semantics of CQL-style queries to reduce the cost of query deployment and duplicate processing thereby increasing system throughput and scalability. Our system exhibits several unique features, including: (1) a ‘reuse lattice ’ to encode both operator similarity and network locality using a uniform data structure; (2) techniques to generate an optimized query grouping plan in the form of ‘relaxed operators ’ to capitalize on reuse opportunities while taking into account multiple run-time variations, such as network locality, data rates, and operator lifetime; and (3) techniques to modify operator semantics at runtime to facilitate reuse. Evaluation of our service-oriented design and techniques under realistic workloads shows that stream queries relaxed and grouped using our approach operate efficiently without a priori knowledge of workload, and offer an order of magnitude improvement in performance over existing approaches. 1
How to influence my customers%3F the impact of electronic market design.

Towards robust trust establishment in web%2Dbased social networks with socialtrust.

Supporting anonymous location queries in mobile environments with privacygrid.

Protecting Location Privacy with Personalized k%2DAnonymity Architecture and Algorithms.
Continued advances in mobile networks and positioning technologies have created a strong market push for location-based applications. Examples include location-aware emergency response, location-based advertisement, and location-based entertainment. An important challenge in the wide deployment of location-based services (LBSs) is the privacy-aware management of location information, providing safeguards for location privacy of mobile clients against vulnerabilities for abuse. This paper describes a scalable architecture for protecting the location privacy from various privacy threats resulting from uncontrolled usage of LBSs. This architecture includes the development of a personalized location anonymization model and a suite of location perturbation algorithms. A unique characteristic of our location privacy architecture is the use of a flexible privacy personalization framework to support location k-anonymity for a wide range of mobile clients with context-sensitive privacy requirements. This framework enables each mobile client to specify the minimum level of anonymity that it desires and the maximum temporal and spatial tolerances that it is willing to accept when requesting k-anonymity-preserving LBSs. We devise an efficient message perturbation engine to implement the proposed location privacy framework. The prototype that we develop is designed to be run by the anonymity server on a trusted platform and performs location anonymization on LBS request messages of mobile clients such as identity removal and spatio-temporal cloaking of the location information. We study the effectiveness of our location cloaking algorithms under various conditions by using realistic location data that is synthetically generated from real road maps and traffic volume data. Our experiments show that the personalized location k-anonymity model, together with our location perturbation engine, can achieve high resilience to location privacy threats without introducing any significant performance penalty. 
PeerCast Churn%2Dresilient end system multicast on heterogeneous overlay networks.

Mitigating application%2Dlevel denial of service attacks on Web servers A client%2Dtransparent approach.

QueST querying music databases by acoustic and textual features.

Countering feedback sparsity and manipulation in reputation systems.

Towards Mobile Internet Location Privacy Threats and Granular Computation Challenges.

DSphere A Source%2DCentric Approach to Crawling

Analyst Forecast Revision and Market Sales Discovery of Online Word of Mouth.

Secure Event Dissemination in Publish%2DSubscribe Networks.

GeoGrid A Scalable Location Service Network.
This paper presents GeoGrid, a geographical location service overlay network system, for providing scalable location-based services to a large and growing number of mobile users. GeoGrid is designed as a decentralized and geographical location aware overlay network and provides system-level facilities and optimizations for balancing load in the presence of node heterogeneity, dynamically moving hot-spots (location queries), and unpredictable rate of node join, departure and failure. GeoGrid uses geographical mapping of nodes to regions and geographical proximity based routing to take advantage of the similarity between physical and network proximity. Furthermore, GeoGrid exploits multiple opportunities for dynamic workload adaptation in the presence of static hotspot queries and moving hotspot queries. Its dynamic load balancing algorithms can efficiently utilize the heterogeneous capacities of end systems and balance both the location query workload and the routing workload.Our initial prototype development and experimental study demonstrate that GeoGrid can effectively reduce the workload imbalance by an order of magnitude. 1
DSphere A Source%2DCentric Approach to Crawling

Lira Lightweight%2C Region%2Daware Load Shedding in Mobile CQ Systems.
To provide high-quality results for location-based, continual queries (CQs) in a mobile system, the query processor usually demands receiving frequent position updates from the mobile nodes. However, processing frequent updates often causes the query processor to become overloaded, under which updates must be dropped randomly, bringing down the query-result accuracy and negating the benefits of frequent updates. In this paper, we develop LIRA − a lightweight, region-aware load-shedding technique for preventively reducing the position-update load of a query processor, while maintaining high-quality query results. Instead of receiving too many updates and then randomly dropping some of them, LIRA uses a region-aware partitioning mechanism to identify the most beneficial shedding regions to cut down the position updates sent by the mobile nodes within those regions. Based on the densities of mobile nodes and queries in a region, LIRA judiciously applies different amounts of update reduction for different regions, aiming to minimize the negative impacts of load shedding on query-result accuracy. Experimental results show that LIRA is vastly superior to random update dropping and clearly outperforms other alternatives that do not possess region-aware load-shedding capabilities. Moreover, due to its lightweight nature, LIRA introduces very little overhead. 1
A Load Shedding Framework and Optimizations for M%2Dway Windowed Stream Joins.
Tuple dropping, though commonly used for load shedding in most stream operations, is inadequate for m-way, windowed stream joins. The join output rate can be overly reduced because it fails to exploit the time correlations likely to exist among interrelated streams. In this paper, we introduce GrubJoin: an adaptive, m-way, windowed stream join that effectively performs time correlation-aware CPU load shedding. GrubJoin maximizes the output rate by achieving nearoptimal window harvesting, which picks only the most profitable window segments for the join. Due to combinatorial explosion of possible m-way join sequences involving window segments, m-way, windowed stream joins pose several unique challenges. We focus on addressing two of them: (1) How can we quickly determine the optimal window harvesting configuration for any m-way, windowed stream join? (2) How can we monitor and learn the time correlations among the streams with high accuracy and minimal overhead? To tackle these challenges, we formalize window harvesting as an optimization problem, develop greedy heuristics to determine nearoptimal window harvesting configurations and use approximation techniques to capture the time correlations. Our experimental results show that GrubJoin is vastly superior to tuple dropping when time correlations exist and is equally effective when time correlations are nonexistent. 1
Efficient and Secure Search of Enterprise File Systems.
With fast paced growth of enterprise data, quickly locating relevant content has become a critical IT capability. Research has shown that nearly 85 % of enterprise data lies in flat filesystems [12] that allow multiple users and user groups with different access privileges to underlying data. Any search tool for such large scale systems needs to be efficient and yet cognizant of the access control semantics imposed by the underlying filesystem. Current multiuser enterprise search techniques use two disjoint search and access-control components by creating a single system-wide index and simply filtering search results for access control. This approach is ineffective as the index and query statistics subtly leak private information. The other available approach of using separate indices for each user is undesirable as it not only increases disk consumption due to shared files, but also increases the overheads of updating the indices whenever a file changes. We propose a distributed approach that couples search and access-control into a unified framework and provides secure multiuser search. Our scheme (logically) divides data into independent access-privileges based chunks, called access-control barrels (ACB). ACBs not only manage security but also improve overall efficiency as they can be indexed and searched in parallel by distributing them to multiple enterprise machines. We describe the architecture of ACBs based search framework and propose two optimization technique that ensure the scalability of our approach. We also discuss other useful features of our approach – seamless integration with desktop search and an extenstion to provide secure search in untrusted storage service provider environments. We validate our approach with a detailed evaluation using industry benchmarks and real datasets. Our initial experiments show secure search with 38 % improved indexing efficiency and low overheads for ACB processing. 1
Message from the IEEE ICWS%2FSCC%2FSERVICES 2007 Plenary Panel Program Co%2DChairs.

A Fault%2DTolerant Middleware Architecture for High%2DAvailability Storage Services.

Optimizing Multiple Distributed Stream Queries Using Hierarchical Network Partitions.
We consider the problem of query optimization in distributed data stream systems where multiple continuous queries may be executing simultaneously. In order to achieve the best performance, query planning (such as join ordering) must be considered in conjunction with deployment planning (e.g., assigning operators to physical nodes with optimal ordering). However, such a combination involves not only a large number of network nodes but also many query operators, resulting in an extremely large search space for optimal solutions. Our paper aims at addressing this problem by utilizing hierarchical network partitions. We propose two algorithms- the Top-Down algorithm and the Bottom-Up algorithm which utilize hierarchical network partitions to provide scalable query optimization. Formal analysis is presented to establish the bounds on the search-space and to show the sub-optimality of our algorithms. We have implemented both algorithms in the IFLOW [14] system, an adaptive distributed stream management system. Through simulations and experiments using a prototype deployed on Emulab [1] we demonstrate the effectiveness of our algorithms. 1.
Spam%2DResilient Web Rankings via Influence Throttling.
Web search is one of the most critical applications for managing the massive amount of distributed Web content. Due to the overwhelming reliance on Web search, there is a rise in efforts to manipulate (or spam) Web search engines. In this paper, we develop a spam-resilient ranking model that promotes a source-based view of the Web. One of the most salient features of our spam-resilient ranking algorithm is the concept of influence throttling. We show how to utilize influence throttling to counter Web spam that aims at manipulating link-based ranking systems, especially PageRank-like systems. Through formal analysis and experimental evaluation, we show the effectiveness and robustness of our spam-resilient ranking model in comparison with existing Web algorithms such as PageRank. 1.
A Utility%2DAware Middleware Architecture for Decentralized Group Communication Applications.
Abstract. The success of Internet telephony services like Skype illustrates the feasibility of utilizing unstructured Peer-to-Peer (P2P) networks as an economical platform for supporting group communication applications. However, the ad-hoc nature of these networks poses significant challenges to the efficiency and scalability of the group communication services. This paper presents the design and implementation of GroupCast − a utility-aware middleware architecture for scalable and efficient P2P group communications. The GroupCast design is characterized by three unique features. First, we present the utility function for quantifying the role of unicast links in enhancing the scalability and efficiency of the group communication applications. This utility function provides a careful combination of the two most important performance factors, namely relative network locations and resource capabilities of the end hosts. Second, we develop a utility-aware distributed spanning tree construction algorithm for efficiently propagating group communication messages. It dynamically creates and maintains the group communication channels by optimizing the utility value of the group communication spanning trees. Third, we propose a utility-based overlay management protocol for constructing and maintaining low-diameter overlay networks to further enhance the performance of the group communication services. We evaluate the effectiveness of the GroupCast middleware architecture through analytical and experimental analysis of the costs and benefits of the proposed techniques. Our experimental results show that the Group-Cast system can improve the scalability of wide-area group communication services by one to two orders of magnitude. Key words: Middleware, peer to peer system 1
A SpatioTemporal Placement Model for Caching Location Dependent Queries.

Improving Wireless Positioning with Look%2Dahead Map%2DMatching.

Countering web spam with credibility%2Dbased link analysis.

Space adaptation privacy%2Dpreserving multiparty collaborative mining with geometric perturbation.
The service-oriented infrastructure has become popular for collaboratively mining data distributed over organizations [3], where the participants are the data providers who submit their perturbed datasets to the designated data mining service provider (the data
Mining multiple private databases using a kNN classifier.
Modern electronic communication has collapsed geographical boundaries for global information sharing but often at the expense of data security and privacy boundaries. Distributed privacy preserving data mining tools are increasingly becoming critical for mining multiple databases with a minimum information disclosure. We present a framework including a general model as well as multi-round algorithms for mining horizontally partitioned databases using a privacy preserving k Nearest Neighbor (kNN) classifier. A salient feature of our approach is that it o#ers a trade-o# between accuracy, e#ciency and privacy through multi-round protocols.
Message from SAINT 2007 Workshops Chairs.

Towards Attack%2DResilient Geometric Data Perturbation.
Data perturbation is a popular technique for privacypreserving data mining. The major challenge of data perturbation is balancing privacy protection and data quality, which are normally considered as a pair of contradictive factors. We propose that selectively preserving only the task/model specific information in perturbation would improve the balance. Geometric data perturbation, consisting of random rotation perturbation, random translation perturbation, and noise addition, aims at preserving the important geometric properties of a multidimensional dataset, while providing better privacy guarantee for data classification modeling. The preliminary study has shown that random geometric perturbation can well preserve model accuracy for several popular classification models, including kernel methods, linear classifiers, and SVM classifiers, while it also revealed some security concerns to random geometric perturbation. In this paper, we address some potential attacks to random geometric perturbation and design several methods to reduce the threat of these attacks. Experimental study shows that the enhanced geometric perturbation can provide satisfactory privacy guarantee while still well preserving model accuracy for the discussed data classification models. 1
From Data Privacy to Location Privacy Models and Algorithms.
This tutorial presents the definition, the models and the techniques of location privacy from the data privacy perspective. By reviewing and revising the state of art research in data privacy area, the presenter describes the essential concepts, the alternative models, and the suite of techniques for providing location privacy in mobile and ubiquitous data management systems. The tutorial consists of two main components. First, we will introduce location privacy threats and give an overview of the state of art research in data privacy and analyze the applicability of the existing data privacy techniques to location privacy problems. Second, we will present the various location privacy models and techniques effective in either the privacy policy based framework or the location anonymization based framework. The discussion will address a number of important issues in both data privacy and location privacy research, including the location utility and location privacy trade-offs, the need for a careful combination of policy-based location privacy mechanisms and location anonymization based privacy schemes, as well as the set of safeguards for secure transmission, use and storage of location information, reducing the risks of unauthorized disclosure of location information. The tutorial is designed to be self-contained, and gives the essential background for anyone interested in learning about the concept and models of location privacy, and the principles and techniques for design and development of a secure and customizable architecture for privacy-preserving mobile data management in mobile and pervasive information systems. This tutorial is accessible to data management administrators, mobile location based service developers, and graduate students and researchers who are interested in data management in mobile information syhhhstems, pervasive computing, and data privacy. 1. DESCRIPTION Location Privacy is a particular type of data privacy. It is defined as the ability to prevent other unauthorized parties from learning ones &#039; current or past location. In Location Based Services (LBSs), there are conceivably two types of location
Preserving data privacy in outsourcing data aggregation services.
Advances in distributed service-oriented computing and internet technology have formed a strong technology push for outsourcing and information sharing. There is an increasing need for organizations to share their data across organization boundaries both within the country and with countries that may have lesser privacy and security standards. Ideally, we wish to share certain statistical data and extract the knowledge from the private databases without revealing any additional information of each individual database apart from the aggregate result that is permitted. In this paper we describe two scenarios for outsourcing data aggregation services and present a set of decentralized peer-to-peer protocols for supporting data sharing across multiple private databases while minimizing the data disclosure among individual parties. Our basic protocols include a set of novel probabilistic computation mechanisms for important primitive data aggregation operations across multiple private databases, such as max, min, and topk selection. We provide an analytical study of our basic protocols in terms of precision, efficiency, and privacy characteristics. Our advanced protocols implement an efficient algorithm for performing kNN classification across multiple private databases. We provide a set of experiments to evaluate the proposed protocols in terms of their correctness, efficiency and privacy characteristics.
A paralleled element%2Dfree Galerkin analysis for structures with cyclic symmetry.

GrubJoin An Adaptive
Tuple dropping, though commonly used for load shedding in most stream operations, is inadequate for m-way, windowed stream joins. The join output rate can be overly reduced because it fails to exploit the time correlations likely to exist among interrelated streams. In this paper, we introduce GrubJoin: an adaptive, m-way, windowed stream join that effectively performs time correlation-aware CPU load shedding. GrubJoin maximizes the output rate by achieving nearoptimal window harvesting, which picks only the most profitable window segments for the join. Due to combinatorial explosion of possible m-way join sequences involving window segments, m-way, windowed stream joins pose several unique challenges. We focus on addressing two of them: (1) How can we quickly determine the optimal window harvesting configuration for any m-way, windowed stream join? (2) How can we monitor and learn the time correlations among the streams with high accuracy and minimal overhead? To tackle these challenges, we formalize window harvesting as an optimization problem, develop greedy heuristics to determine nearoptimal window harvesting configurations and use approximation techniques to capture the time correlations. Our experimental results show that GrubJoin is vastly superior to tuple dropping when time correlations exist and is equally effective when time correlations are nonexistent. 1
Scalable Delivery of Dynamic Content Using a Cooperative Edge Cache Grid.
Abstract—In recent years, edge computing has emerged as a popular mechanism to deliver dynamic Web content to clients. However, many existing edge cache networks have not been able to harness the full potential of edge computing technology. In this paper, we argue and experimentally demonstrate that cooperation among the individual edge caches coupled with scalable serverdriven document consistency mechanisms can significantly enhance the capabilities and performance of edge cache networks in delivering fresh dynamic content. However, designing large-scale cooperative edge cache networks presents many research challenges. Toward addressing these challenges, this paper presents cooperative edge cache grid (cooperative EC grid, for short)—a large-scale cooperative edge cache network for efficiently delivering highly dynamic Web content with varying server update frequencies. The design of the cooperative EC grid focuses on the scalability and reliability of dynamic content delivery in addition to cache hit rates, and it incorporates several novel features. We introduce the concept of cache clouds as a generic framework of cooperation in large-scale edge cache networks. The architectural design of the cache clouds includes dynamic hashing-based document lookup and update protocols, which dynamically balance lookup and update loads among the caches in the cloud. We also present cooperative techniques for making the document lookup and update protocols resilient to the failures of individual caches. This paper reports a series of simulation-based experiments which show that the overheads of cooperation in the cooperative EC grid are very low, and our architecture and techniques enhance the performance of the cooperative edge networks. Index Terms—Dynamic content caching, edge computing, cooperative caching, cache clouds. 1
ASAP An Adaptive Sampling Approach to Data Collection in Sensor Networks.
Abstract — One of the most prominent and comprehensive ways of data collection in sensor networks is to periodically extract raw sensor readings. This way of data collection enables complex analysis of data, which may not be possible with in-network aggregation or query processing. However, this flexibility in data analysis comes at the cost of power consumption. In this paper we develop ASAP − an adaptive sampling approach to energyefficient periodic data collection in sensor networks. The main idea behind ASAP is to use a dynamically changing subset of the nodes as samplers such that the sensor readings of the sampler nodes are directly collected, whereas the values of the non-sampler nodes are predicted through the use of probabilistic models that are locally and periodically constructed. ASAP can be effectively used to increase the network lifetime while keeping the quality of the collected data high, in scenarios where either the
Service Class Driven Dynamic Data Source Discovery with DynaBot.

Development of Distance Measures for Process Mining%2C Discovery and Integration.

CPU load shedding for binary stream joins.

Proceedings of the 22nd International Conference on Data Engineering

Mobile Web and Location%2DBased Services.
Abstract. Today’s georeferencing approaches and Location-Based Services (LBS) are primarily closed, domain-specific applications. In this paper, we introduce our vision of an ‘Open Spatial Repository ’ as a first step towards loosely coupled LBS. To illustrate this idea, we present a novel location-aware Web browsing metaphor: according to a user’s location and her current surrounding, the ‘Real World Web Browser ’ allows the visual discovery and access of georeferenced services and thereby enables new use cases beyond common tourist guides and static points-of-interest (POIs). Keywords: Mobile Web, Location-Based Services, Visualization 1
Process Mining by Measuring Process Block Similarity.

Efficiently clustering transactional data with weighted coverage density.
It is widely recognized that developing efficient and fully automated algorithms for clustering large transactional datasets is a challenging problem. In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the concept of Weighted Coverage Density as a categorical similarity measure for efficient clustering of transactional datasets. The concept of weighted coverage density is intuitive and allows the weight of each item in a cluster to be changed dynamically according to the occurrences of items. Second, we develop two transactional data clustering specific evaluation metrics based on the concept of large transactional items and the coverage density respectively. Third, we implement the weighted coverage density clustering algorithm and the two clustering validation metrics using a fully automated transactional clustering framework, called SCALE (Sampling, Clustering structure Assessment, cLustering and domain-specific Evaluation). The SCALE framework is designed to combine the weighted coverage density measure for clustering over a sample dataset with self-configuring methods that can automatically tune the two important parameters of the clustering algorithms: (1) the candidates of the best number K of clusters; and (2) the application of two domain-specific cluster validity measures to find the best result from the set of clustering results. We have conducted experimental evaluation using both synthetic and real datasets and our results show that the weighted coverage-density approach powered by the SCALE framework can efficiently generate high quality clustering results in a fully automated manner.
k nearest neighbor classification across multiple private databases.
Distributed privacy preserving data mining tools are critical for mining multiple databases with a minimum information disclosure. We present a framework including a general model as well as multi-round algorithms for mining horizontally partitioned databases using a privacy preserving k Nearest Neighbor (kNN) classifier.
Key Derivation Algorithms for Monotone Access Structures in Cryptographic File Systems.

Efficient Formation of Edge Cache Groups for Dynamic Content Delivery.

Process Mining%2C Discovery%2C and Integration using Distance Measures.
Business processes continue to play an important role in today’s service-oriented enterprise computing systems. Mining, discovering, and integrating processoriented services has attracted growing attention in the recent year. In this paper we present a quantitative approach to modeling and capturing the similarity and dissimilarity between different process designs. We derive the similarity measures by analyzing the process dependency graphs of the participating workflow processes. We first convert each process dependency graph into a normalized process matrix. Then we calculate the metric space distance between the normalized matrices. This distance measure can be used as a quantitative and qualitative tool in process mining, process merging, and process clustering, and ultimately it can reduce or minimize the costs involved in design, analysis, and evolution of workflow systems. 1.
Software and Services Where do they meet%3F

A Middleware System for Protecting Against Application Level Denial of Service Attacks.
Abstract. Recently, we have seen increasing numbers of denial of service (DoS) attacks against online services and web applications either for extortion reasons, or for impairing and even disabling the competition. These DoS attacks have increasingly targeted the application level. Application level DoS attacks emulate the same request syntax and network level traffic characteristics as those of legitimate clients, thereby making the attacks much harder to be detected and countered. Moreover, such attacks usually target bottleneck resources such as disk bandwidth, database bandwidth, and CPU resources. In this paper we propose server-side middleware to counter application level DoS attacks. The key idea behind our technique is to adaptively vary a client’s priority level, and the relative amount of resources devoted to this client, in response to the client’s past requests in a way that incorporates application level semantics. Application specific knowledge is used to evaluate the cost and the utility of each request and the likelihood that a sequence of requests are sent by a malicious client. Based on the evaluations, a client’s priority level is increased or decreased accordingly. A client’s priority level is used by the server side firewall to throttle the client’s request rate, thereby ensuring that more server side resources are allocated to the legitimate clients. We present a detailed implementation of our approach on the Linux kernel and evaluate it using two sample applications: Apache HTTPD micro-benchmarks and TPCW. Our experiments show that our approach incurs low performance overhead and is resilient to application level DoS attacks. 1
Detecting the Change of Clustering Structure in Categorical Data Streams.
Analyzing clustering structures in data streams can provide critical information for making decision in realtime. Most research has been focused on clustering algorithms for data streams. We argue that, more importantly, we need to monitor the change of clustering structure online. In this paper, we present a framework for detecting the change of critical clustering structure in categorical data streams, which is indicated by the change of the best number of clusters (Best K) in the data stream. The framework extends the work on determining the best K for static datasets (the BkPlot method) to categorical data streams with the help of a Hierarchical Entropy Tree structure (HE-Tree). HE-Tree can efficiently capture the entropy property of the categorical data streams and allow us to draw precise clustering information from the data stream for highquality BkPLots. The experiments show that with the combination of HE-Tree and the BkPlot method we are able to efficiently and precisely detect the change of critical clustering structure in categorical data streams. 1
Distributed query sampling a quality%2Dconscious approach.

Quality%2Daware dstributed data delivery for continuous query services.

A Client%2DTransparent Approach to Defend Against Denial of Service Attacks.
Abstract. Denial of Service (DoS) attacks attempt to consume a server’s resources (network bandwidth, computing power, main memory, disk bandwidth etc) to near exhaustion so that there are no resources left to handle requests from legitimate clients. An effective solution to defend against DoS attacks is to filter DoS attack requests at the earliest point (say, the web site’s firewall), before they consume much of the server’s resources. Most defenses against DoS attacks attempt to filter requests from inauthentic clients before they consume much of the server’s resources. Client authentication using techniques like IPSec or SSL may often require changes to the client-side software and may additionally require superuser privileges at the client for deployment. Further, using digital signatures (as in SSL) makes verification very expensive, thereby making the verification process itself a viable DoS target for the adversary. In this paper, we propose a light-weight client transparent technique to defend
Privacy Analysis for Data Sharing in %2Anix Systems.
Linux and its various flavors (together called *nix) are growing in mainstream popularity and many enterprise infrastructures now are based on *nix platforms. An important component of these systems is the ingrained multi-user support that lets users share data with each other. In this paper, we analyze *nix systems and identify an urgent need for better privacy support in their data sharing mechanisms. In one of our studies it was possible to access over 84 GB of private data at one organization of 836 users, including over 300,000 emails and 579 passwords to financial and other private services websites. The most surprising aspect was the extremely low level of sophistication of the attack. The attack uses no technical vulnerabilities, rather inadequacies of *nix access control combined with user/application’s privacyindifferent behavior. 1
iVIBRATE Interactive visualization%2Dbased framework for clustering large datasets.

Guest Editors%27 Introduction Sensor%2DNetwork Applications.

Processing Moving Queries over Moving Objects Using Motion%2DAdaptive Indexes.
Abstract—This paper describes a motion-adaptive indexing scheme for efficient evaluation of moving continual queries (MCQs) over moving objects. It uses the concept of motion-sensitive bounding boxes (MSBs) to model moving objects and moving queries. These bounding boxes automatically adapt their sizes to the dynamic motion behaviors of individual objects. Instead of indexing frequently changing object positions, we index less frequently changing object and query MSBs, where updates to the bounding boxes are needed only when objects and queries move across the boundaries of their boxes. This helps decrease the number of updates to the indexes. More importantly, we use predictive query results to optimistically precalculate query results, decreasing the number of searches on the indexes. Motion-sensitive bounding boxes are used to incrementally update the predictive query results. Furthermore, we introduce the concepts of guaranteed safe radius and optimistic safe radius to extend our motion-adaptive indexing scheme to evaluating moving continual k-nearest neighbor ðkNNÞ queries. Our experiments show that the proposed motion-adaptive indexing scheme is efficient for the evaluation of both moving continual range queries and moving continual kNN queries. Index Terms—Moving object databases, spatio-temporal indexing, continual queries. 1
MobiEyes A Distributed Location Monitoring Service Using Moving Location Queries.
Abstract—With the growing popularity and availability of mobile communications, our ability to stay connected while on the move is becoming a reality instead of science fiction as it was just a decade ago. An important research challenge for modern location-based services is the scalable processing of location monitoring requests on a large collection of mobile objects. The centralized architecture, though studied extensively in literature, would create intolerable performance problems as the number of mobile objects grows significantly. This paper presents a distributed architecture and a suite of optimization techniques for scalable processing of continuously moving location queries. Moving location queries can be viewed as standing location tracking requests that continuously monitor the locations of mobile objects of interest and return a subset of mobile objects when certain conditions are met. We describe the design of MobiEyes, a distributed real time location monitoring system in a mobile environment. The main idea behind the MobiEyes ’ distributed architecture is to promote a careful partition of a real time location monitoring task into an optimal coordination of server-side processing and client-side processing. Such a partition allows evaluating moving location queries with a high degree of precision using a small number of location updates, thus providing highly scalable location monitoring services. A set of optimization techniques are used to limit the amount of computation to be handled by the mobile objects and enhance the overall performance and system utilization of MobiEyes. Important metrics to validate the proposed architecture and optimizations include messaging cost, server load, and amount of computation at individual mobile objects. We evaluate the scalability of the MobiEyes location monitoring approach using a simulation model based on a mobile setup. Our experimental results show that MobiEyes can lead to significant savings in terms of server load and messaging cost when compared to solutions relying on central processing of location information. Index Terms—Spatial queries over mobile objects, distributed algorithms, mobile data management. 1
Large Scaling Unstructured Peer%2Dto%2DPeer Networks with Heterogeneity%2DAware Topology and Routing.
Abstract—Peer-to-peer (P2P) file sharing systems such as Gnutella have been widely acknowledged as the fastest-growing Internet applications ever. The P2P model has many potential advantages, including high flexibility and serverless management. However, these systems suffer from the well-known performance mismatch between the randomly constructed overlay network topology and the underlying IP-layer topology. This paper proposes to structure the P2P overlay topology using a heterogeneity-aware multitier topology to better balance the load at peers with heterogeneous capacities and to prevent low-capability nodes from throttling the performance of the system. An analytical model is developed to enable the construction and maintenance of heterogeneity-aware overlay topologies with good node connectivity and better load balance. We also develop an efficient routing scheme, called probabilistic selective routing, that further utilizes heterogeneity-awareness to enhance the routing performance. We evaluate our design through simulations. The results show that our multitier topologies alone can provide eight to 10 times improvement in the messaging cost, two to three orders of magnitude improvement in terms of load balancing, and seven to eight times lower topology construction and maintenance costs when compared to Gnutella’s random power-law topology. Moreover, our heterogeneity-aware routing scheme provides further improvements on all evaluation metrics, when used with our heterogeneity-aware overlay topologies. Index Terms—Peer-to-peer systems, overlay topology, overlay routing, node heterogeneity, load balancing. Ç 1
XWRAPComposer A Multi%2DPage Data Extraction Service.

Agyaat mutual anonymity over structured P2P networks.

Securing decentralized reputation management using TrustGuard.

Book review H. Zhuge

Discovering Interesting Relationships among Deep Web Databases A Source%2DBiased Approach.

Securing publish%2Dsubscribe overlay services with EventGuard.

Adaptive load shedding for windowed stream joins.
We present an adaptive load shedding approach for windowed stream joins. In contrast to the conventional approach of dropping tuples from the input streams, we explore the concept of selective processing for load shedding. We allow stream tuples to be stored in the windows and shed excessive CPU load by performing the join operations, not on the entire set of tuples within the windows, but on a dynamically changing subset of tuples that are learned to be highly beneficial. We support such dynamic selective processing through three forms of runtime adaptations: adaptation to input stream rates, adaptation to time correlation between the streams and adaptation to join directions. Our load shedding approach enables us to integrate utility-based load shedding with time correlation-based load shedding. Indexes are used to further speed up the execution of stream joins. Experiments are conducted to evaluate our adaptive load shedding in terms of output rate and utility. The results show that our selective processing approach to load shedding is very effective and significantly outperforms the approach that drops tuples from the input streams. 1
Collaborative Computing Issues and Challenges %28Panel%29.

Towards Global Collaborative Computing Opportunities and Challenges of Peer to Peer Networks and Applications.

Topk Queries across Multiple Private Databases.

Cache Clouds Cooperative Caching of Dynamic Documents in Edge Networks.
Caching on the edge of the Internet is becoming a popular technique to improve the scalability and efficiency of delivering dynamic web content. In this paper we study the challenges in designing a large scale cooperative edge cache network, focusing on mechanisms and methodologies for efficient cooperation among caches to improve the overall performance of the edge cache network. This paper makes three original contributions. First, we introduce the concept of cache clouds, which forms the fundamental framework for cooperation among caches in the edge network. Second, we present dynamic hashing-based protocols for document lookups and updates within each cache cloud, which are not only efficient, but also effective in dynamically balancing lookup and update loads among the caches in the cloud. Third, we outline a utility-based mechanism for placing dynamic documents within a cache cloud. Our experiments indicate that these techniques can significantly improve the performance of the edge cache networks. 1.
Location Privacy in Mobile Systems A Personalized Anonymization Model.

Privacy Preserving Data Classification with Rotation Perturbation.

Mutation Operators for Object%2DZ Specification.

Domain%2DSpecific Web Service Discovery with Service Class Descriptions.
This paper presents DynaBot, a domain-specific web service discovery system. The core idea of the DynaBot service discovery system is to use domain-specific service class descriptions powered by an intelligent Deep Web crawler. In contrast to current registry-based service discovery systems – like the several available UDDI registries – DynaBot promotes focused crawling of the Deep Web of services and discovers candidate services that are relevant to the domain of interest. It uses intelligent filtering algorithms to match services found by focused crawling with the domain-specific service class descriptions. We demonstrate the capability of DynaBot through the BLAST scenario and describe our initial experience with DynaBot. 1
Resilient Trust Management for Web Service Integration.
In a distributed web service integration environment, the selection of web services should be based on their reputation and quality-of-service (QoS). Various trust models for web services have been proposed to evaluate the reputation of web services/service providers. Current mechanisms are based on tracing the feedbacks to the past behaviors of web services. However, very few of them consider the robustness and attackresiliency of the trust models. In this paper, we present an attack resilient distributed trust management system in a web service management environment. The proposed attack resilient trust model uses two vectors to capture the behavior and the trustworthiness of a web service/service provider based on our analysis on the possible attacks against the trust models. We also present a set of experiments that show the effectiveness of our trust model in detecting malicious behavior of service providers. 1 1
XWRAPComposer A Multi%2DPage Data Extraction Service for Bio%2DComputing Applications.

ExchangeGuard A Distributed Protocol for Electronic Fair%2DExchange.
Electronic fair-exchange protocols have received significant attention from the research community in the recent past. In loose terms, the fair exchange problem is defined as atomically exchanging electronic items between two parties. All the known fair exchange protocols today utilize a centralized trusted third party server either actively or passively. In this paper, we propose a distributed protocol for exchange of electronic items using untrusted servers. We perform detailed security analysis and show that the protocol guarantees effectiveness and fairness with Byzantine failures of up to one third of the untrusted servers. We also give the probability of a fair exchange otherwise. Finally we discuss how to deploy the protocol to large online electronic communities and peer-to-peer systems and demonstrate its security guarantees, scalability and load balancing properties.
A Hybrid Access Model for Storage Area Networks.
We present HSAN - a hybrid storage area network, which uses both in-band (like NFS [13]) and out-of-band virtualization (like SAN FS [10]) access models. HSAN uses hybrid servers that can serve as both metadata and NAS servers to intelligently decide the access model per each request, based on the characteristics of requested data. This is in contrast to existing efforts that merely provide concurrent support for both models and do not exploit model appropriateness for requested data. The HSAN hybrid model is implemented using low overhead cacheadmission and cache-replacement schemes and aims to improve overall response times for a wide variety of workloads. Preliminary analysis of the hybrid model indicates performance improvements over both models.
Security vs Performance Tradeoffs using a Trust Framework.
We present an architecture of a trust framework that can be utilized to intelligently tradeoff between security and performance in a SAN file system. The primary idea is to differentiate between various clients in the system based on their trustworthiness and provide them with different levels of security /performance. Client trustworthiness is evaluated dynamically using a customizable trust model by online monitoring of the client&#039;s behavior. We also describe the interface of the trust framework with a block level security solution for an out-of-band virtualization based SAN file system (SAN FS [7]). The proposed framework can also be easily extended to provide differential treatment based on data sensitivity, using a configurable parameter of the trust model.
The %22Best K%22 for Entropy%2Dbased Categorical Data Clustering.
With the growing demand on cluster analysis for categorical data, a handful of categorical clustering algorithms have been developed. Surprisingly, to our knowledge, none has satisfactorily addressed the important problem for categorical clustering – how can we determine the best K number of clusters for a categorical dataset? Since categorical data does not have the inherent distance function as the similarity measure, traditional cluster validation techniques based on the geometry shape and density distribution cannot be applied to answer this question. In this paper, we investigate the entropy property of the categorical data and propose a BkPlot method for determining a set of candidate “best Ks”. This method is implemented with a hierarchical clustering algorithm ACE. The experimental results show that our approach can effectively identify the significant clustering structures. 1
XPACK A High%2DPerformance WEB Document Encoding.

Building a Semantic Web System for Scientific Applications An Engineering Approach.

TrustGuard countering vulnerabilities in reputation management for decentralized overlay networks.
Reputation systems have been popular in estimating the trustworthiness and predicting the future behavior of nodes in a large-scale distributed system where nodes may transact with one another without prior knowledge or experience. One of the fundamental challenges in distributed reputation management is to understand vulnerabilities and develop mechanisms that can minimize the potential damages to a system by malicious nodes. In this paper, we identify three vulnerabilities that are detrimental to decentralized reputation management and propose TrustGuard -- safeguard framework for providing a highly dependable and yet efficient reputation system. First, we provide a dependable trust model and a set of formal methods to handle strategic malicious nodes that continuously change their behavior to gain unfair advantages in the system. Second, a transaction based reputation system must cope with the vulnerability that malicious nodes may misuse the system by flooding feedbacks with fake transactions. Third, but not least, we identify the importance of filtering out dishonest feedbacks when computing reputation-based trust of a node, including the feedbacks filed by malicious nodes through collusion. Our experiments show that, comparing with existing reputation systems, our framework is highly dependable and effective in countering malicious nodes regarding strategic oscillating behavior, flooding malevolent feedbacks with fake transactions, and dishonest feedbacks.
Exploiting the deep web with DynaBot matching%2C probing%2C and ranking.
We present the design of Dynabot, a guided Deep Web discovery system. Dynabot&#039;s modular architecture supports focused crawling of the Deep Web with an emphasis on matching, probing, and ranking discovered sources using two key components: service class descriptions and source-biased analysis. We describe the overall architecture of Dynabot and discuss how these components support effective exploitation of the massive Deep Web data available.
Querying the past%2C present and future where we are and where we will be.

A Scalable Peer%2Dto%2DPeer Architecture for Distributed Information Monitoring Applications.
Abstract—We present PeerCQ, a decentralized architecture for Internet scale information monitoring using a network of heterogeneous peer nodes. PeerCQ uses Continual Queries (CQs) as its primitives to express information-monitoring requests. The PeerCQ development has three unique characteristics. First, we develop a systematic and serverless approach to large scale information monitoring, aiming at providing a fully distributed, highly scalable, and self-configurable architecture for scalable and reliable processing of a large number of CQs over a network of loosely coupled, heterogeneous, and possibly unreliable nodes (peers). Second, we introduce an effective service partitioning scheme at the P2P protocol layer to distribute the processing of CQs over a peer-to-peer information monitoring overlay network while maintaining a good balance between system utilization and load balance in the presence of peer joins, departures, and failures. A unique feature of our service partitioning scheme is its ability to incorporate strategies for handling hot spot monitoring requests and peer heterogeneity into the load balancing scheme in PeerCQ. Third, but not least, we develop a dynamic passive replication scheme to enable reliable processing of long-running information monitoring requests in an environment of inherently unreliable peers, including an analytical model to discuss its fault tolerance properties. We report a set of experiments demonstrating the feasibility and the effectiveness of the PeerCQ approach to large-scale peer-to-peer information monitoring. Index Terms—Distributed information monitoring, peer-to-peer networks, continual query systems. 1
Automatic Fragment Detection in Dynamic Web Pages and Its Impact on Caching.
Abstract—Constructing Web pages from fragments has been shown to provide significant benefits for both content generation and caching. In order for a Web site to use fragment-based content generation, however, good methods are needed for fragmenting the Web pages. Manual fragmentation of Web pages is expensive, error prone, and unscalable. This paper proposes a novel scheme to automatically detect and flag fragments that are cost-effective cache units in Web sites serving dynamic content. Our approach analyzes Web pages with respect to their information sharing behavior, personalization characteristics, and change patterns. We identify fragments which are shared among multiple documents or have different lifetime or personalization characteristics. Our approach has three unique features. First, we propose a framework for fragment detection, which includes a hierarchical and fragmentaware model for dynamic Web pages and a compact and effective data structure for fragment detection. Second, we present an efficient algorithm to detect maximal fragments that are shared among multiple documents. Third, we develop a practical algorithm that effectively detects fragments based on their lifetime and personalization characteristics. This paper shows the results when the algorithms are applied to real Web sites. We evaluate the proposed scheme through a series of experiments, showing the benefits and costs of the algorithms. We also study the impact of using the fragments detected by our system on key parameters such as disk space utilization, network bandwidth consumption, and load on the origin servers. Index Terms—Dynamic content caching, fragment-based caching, fragment detection. 1
QA%2DPagelet Data Preparation Techniques for Large%2DScale Data Analysis of the Deep Web.
This paper presents the QA-Pagelet as a fundamental data preparation technique for large scale data analysis of the Deep Web. To support QA-Pagelet extraction, we present the Thor framework for sampling, locating, and partioning the QA-Pagelets from the Deep Web. Two unique features of the Thor framework are (1) the novel page clustering for grouping pages from a Deep Web source into distinct clusters of control-flow dependent pages; and (2) the novel subtree filtering algorithm that exploits the structural and content similarity at subtree level to identify the QA-Pagelets within highly ranked page clusters. We evaluate the effectiveness of the Thor framework through experiments using both simulation and real datasets. We show that Thor performs well over millions of Deep Web pages and over a wide range of sources, including eCommerce sites, general and specialized search engines, corporate websites, medical and legal resources, and several others. Our experiments also show that the proposed page clustering algorithm achieves low-entropy clusters, and the subtree filtering algorithm identifies QA-Pagelets with excellent precision and recall.
A Distributed Approach to Node Clustering in Decentralized Peer%2Dto%2DPeer Networks.
Abstract—Connectivity-based node clustering has wide-ranging applications in decentralized peer-to-peer (P2P) networks such as P2P file sharing systems, mobile ad-hoc networks, P2P sensor networks, and so forth. This paper describes a Connectivity-based Distributed Node Clustering scheme (CDC). This scheme presents a scalable and efficient solution for discovering connectivity-based clusters in peer networks. In contrast to centralized graph clustering algorithms, the CDC scheme is completely decentralized and it only assumes the knowledge of neighbor nodes instead of requiring a global knowledge of the network (graph) to be available. An important feature of the CDC scheme is its ability to cluster the entire network automatically or to discover clusters around a given set of nodes. To cope with the typical dynamics of P2P networks, we provide mechanisms to allow new nodes to be incorporated into appropriate existing clusters and to gracefully handle the departure of nodes in the clusters. These mechanisms enable the CDC scheme to be extensible and adaptable in the sense that the clustering structure of the network adjusts automatically as nodes join or leave the system. We provide detailed experimental evaluations of the CDC scheme, addressing its effectiveness in discovering good quality clusters and handling the node dynamics. We further study the types of topologies that can benefit best from the connectivitybased distributed clustering algorithms like CDC. Our experiments show that utilizing message-based connectivity structure can considerably reduce the messaging cost and provide better utilization of resources, which in turn improves the quality of service of the applications executing over decentralized peer-to-peer networks. Index Terms—Distributed node clustering, connectivity-based graph clustering, peer-to-peer networks, decentralized network management. 1
A methodical approach to extracting interesting objects from dynamic web pages.
Abstract: This paper presents a fully automated object extraction system for web documents. Our methodology consists of a layered framework and a suite of algorithms. A distinct feature of our approach is the full automation of both the extraction of data object regions from dynamic Web pages and the identification of correct object boundary separators. We implemented the methodology in the XWRAPElite object extraction system and evaluated the system using more than 3,200 pages over 75 diverse web sites. Our experiments show three important and interesting results: First, our algorithms for identifying the minimal object rich subtree achieves 96 % success rate over all web pages we have tested. Second, our algorithms for discovering and extracting object separator tags reach the success rate of 95%. Most significantly, the overall system achieves precision between 96 % and 100 % (returns only correct objects) and excellent recall (between 95 % and 96%, with very few significant objects left out). The minimal subtree extraction algorithms and the object boundary identification algorithms are fast, about 87 milliseconds per page with an average page size of 30KB.
Vulnerabilities and Security Threats in Structured Overlay Networks A Quantitative Analysis.

ClusterMap labeling clusters in large datasets via visualization.
With the rapid increase of data in many areas, clustering on large datasets has become an important problem in data analysis. Since cluster analysis is a highly iterative process, cluster analysis on large datasets prefers short iteration on a relatively small representative set. Thus, a two-phase framework “sampling/summarization – iterative cluster analysis ” is often applied in practice. Since the clustering result only labels the small representative set, there are problems with extending the result to the entire large dataset, which are almost ignored by the traditional clustering research. This extending is often named as labeling process. Labeling irregular shaped clusters, distinguishing outliers and extending cluster boundary are the main problems in this stage. We address these problems and propose a visualization-based approach to dealing with them precisely. This approach partially involves human into the process of defining and refining the structure “ClusterMap”. Based on this structure, the ClusterMap algorithm scans the large dataset to adapt the boundary extension and generate the cluster labels for the entire dataset. Experimental result shows that ClusterMap can preserve cluster quality considerably with low computational cost, compared to the distance-comparison-based labeling algorithms. Categories and Subject Descriptors I.5.3 [Clustering]: Labeling algorithms for large datasets. H.1.2 [User/Machine Systems]: Human factors in clustering large datasets
Motion adaptive indexing for moving continual queries over moving objects.
This paper describes a motion adaptive indexing scheme for efficient evaluation of moving continual queries (MCQs) over moving objects. It uses the concept of motion-sensitive bounding boxes (MSBs) to model moving objects and moving queries. These bounding boxes automatically adapt their sizes to the dynamic motion behaviors of individual objects. Instead of indexing frequently changing object positions, we index less frequently changing object and query MSBs, where updates to the bounding boxes are needed only when objects and queries move across the boundaries of their boxes. This helps decrease the number of updates to the indexes. More importantly, we use predictive query results to optimistically precalculate query results, decreasing the number of searches on the indexes. Motion-sensitive bounding boxes are used to incrementally update the predictive query results. Our experiments show that the proposed motion adaptive indexing scheme is efficient for the evaluation of moving continual range queries.
Formalizing the Semantics of UML Statecharts with Z%2A.

MobiEyes Distributed Processing of Continuously Moving Queries on Moving Objects in a Mobile System.
Location monitoring is an important issue for real time management of mobile  object positions. Significant research efforts have been dedicated to techniques for  efficient processing of spatial continuous queries on moving objects in a centralized location  monitoring system. Surprisingly, very few have promoted a distributed approach  to real-time location monitoring. In this paper we present a distributed and scalable  solution to processing continuously moving queries on moving objects and describe  the design of MobiEyes, a distributed real-time location monitoring system in a mobile  environment. Mobieyes utilizes the computational power at mobile objects, leading to  significant savings in terms of server load and messaging cost when compared to solutions  relying on central processing of location information at the server. We introduce a  set of optimization techniques, such as Lazy Query Propagation, Query Grouping, and  Safe Periods, to constrict the amount of computations handled by the moving objects  and to enhance the performance and system utilization of Mobieyes. We also provide a  simulation model in a mobile setup to study the scalability of the MobiEyes distributed  location monitoring approach with regard to server load, messaging cost, and amount  of computation required on the mobile objects.
Energy efficient exact kNN search in wireless broadcast environments.
The advances in wireless communication and decreasing costs of mobile devices have enabled users to access desired information at any time. Coupled with positioning technologies like GPS, this opens up an exciting domain of location based services, allowing a mobile user to query for objects based on its current position. Main bottlenecks in such infrastructures are the draining of power of the mobile devices and the limited network bandwidth available. To alleviate these problems,  broadcasting spatial information about relevant objects has been widely accepted as an e#cient mechanism. An important class of queries for such an infrastructure is the k- nearest neighbor (kNN) queries, in which users are interested in k closest objects to their position. In this paper, we describe mechanisms to perform exact kNN search on conventional sequential-access R-trees, and optimize established kNN search algorithms. We also propose a novel use of histograms for guiding the search and derive analytical results on maximum queue size and node access count. In addition, we discuss the e#ects of di#erent broadcast organizations on search performance and challenge the traditional use of Depth-First (df s ) organization. We also extend our mechanisms to support kNN search with non-spatial constraints. While we demonstrate our ideas using a broadcast index, they are equally applicable to any kind of sequential access medium like tertiary tape storage. We validate our mechanisms through an extensive experimental analysis and present our findings.
A Hybrid Topology Architecture for P2P Systems.
A core area of P2P systems research is the topology of the overlay network. It has ranged from random unstructured networks like Gnutella [8] to Super-Peer [9] architectures to the recent trend of structured overlays based on Distributed Hash Tables (DHTs) [4, 12, 11]. While the unstructured networks have excessive lookup costs and un-guaranteed lookups, the structured systems offer no anonymity and delegate control over data items to unrelated peers. In this paper, we present an in-themiddle hybrid architecture which uses a mix of both topologies to create a decentralized P2P infrastructure. The system provides scalable and guaranteed lookups in addition to mutual anonymity and also allows hosting content with the content-owner. We validate our architecture through a thorough analytical and empirical performance analysis of the system.
Probe
nonlinear rheology with inertio-elastic oscillations
A Specification%2DBased Approach to Testing Polymorphic Attributes.

Scaling Unstructured Peer%2Dto%2DPeer Networks With Multi%2DTier Capacity%2DAware Overlay Topologies.
The peer to peer (P2P) file sharing systems such as Gnutella have been widely acknowledged as the fastest growing Internet applications ever. The P2P model has many potential advantages due to the design flexibility of overlay networks and the serverless management of cooperative sharing of information and resources. However, these systems suffer from the well-known performance mismatch between the randomly constructed overlay network topology and the underlying IP layer topology for packet routing. This paper proposes to structure the P2P overlay topology using a capacity-aware multi-tier topology to better balance load at peers with heterogeneous capacities and to prevent low capacity nodes from downgrading the performance of the system. An analytical model is developed to enable us to construct and maintain capacity-aware overlay topologies with good node connectivity and better load balance. To study the benefits and cost of the multi-tier capacity aware topology with respect to basic and advanced routing protocols, we also develop a probabilistic broadening scheme for efficient routing, which further utilizes capacity-awareness to enhance the P2P routing performance of the system. We evaluate our design through simulations. The results show that our multi-tier topologies alone can provide eight to ten times improvements in the messaging cost, two to three orders of magnitude improvement in terms of load balancing characteristics, and seven to eight times lower topology construction and maintenance costs when compared to Gnutellas random power-law topology.
Discovering and ranking web services with BASIL a personalized approach with biased focus.

MC%2DCDMA Based IEEE 802.11 Wireless LAN.

Infopipes The ISL%2FISG Implementation Evaluation.
We provide a performance comparison of generated Infopipes that have been translate the Spi/XIP variant of Infopipe specification into executable code. Infopipes are an abstraction to support information flow applications. These tools are evaluated through a realistic application: a continuous image streaming program. We implement the application in C and compare its performance to both a hand-written application and one that uses SunRPC. 1.
A modified IEEE 802.11 MAC protocol for MC%2DCDMA.

Reliable Peer%2Dto%2DPeer End System Multicasting through Replication.
A key challenge in peer-to-peer computing system is to provide decentralized and yet reliable service on top of a network of loosely coupled, weakly connected and possibly unreliable peers. This paper presents an effective dynamic passive replication scheme designed to provide reliable multicast service in PeerCast, an efficient and self-configurable peer-to-peer End System Multicast (ESM) system. We first describe the design of a distributed replication scheme, which enables reliable subscription and multicast dissemination of information in an environment of inherently unreliable peers. Then we present an analytical model to discuss its fault tolerance properties, and report a set of initial experiments, showing the feasibility and the effectiveness of the proposed approach.

Context Cube Flexible and Effective Manipulation of Sensed Context Data.
Abstract. In an effort to support the development of context-aware applications that use archived sensor data, we introduce the concept of the Context Cube based on techniques of data warehousing and data mining. Our implementation of the Context Cube provides a system that supports a multi-dimensional model of context data and with tools for accessing, interpreting and aggregating that data by using concept relationships defined within the real context of the application. We define the Context Cube information model, demonstrate functional applications that we have developed with the system, and explore possible applications that may be developed more easily using our tool. 1
Automatic detection of fragments in dynamically generated web pages.
Dividing web pages into fragments has been shown to provide significant benefits for both content generation and caching. In order for a web site to use fragment-based content generation, however, good methods are needed for dividing web pages into fragments. Manual fragmentation of web pages is expensive, error prone, and unscalable. This paper proposes a novel scheme to automatically detect and flag fragments that are cost-effective cache units in web sites serving dynamic content. We consider the fragments to be interesting if they are shared among multiple documents or they have different lifetime or personalization characteristics. Our approach has three unique features. First, we propose a hierarchical and fragment-aware model of the dynamic web pages and a data structure that is compact and effective for fragment detection. Second, we present an efficient algorithm to detect maximal fragments that are shared among multiple documents. Third, we develop a practical algorithm that effectively detects fragments based on their lifetime and personalization characteristics. We evaluate the proposed scheme through a series of experiments, showing the benefits and costs of the algorithms. We also study the impact of adopting the fragments detected by our system on disk space utilization and network bandwidth consumption.
BizCQ using continual queries to cope with changes in business information exchange.
In this poster, we propose the framework of BizCQ, a system to apply Continual Queries [7][8] on Web-based content to manage information exchanges between two business partners. In this poster, we describe ways to leverage previous research in Web monitoring techniques applied to the everyday problem of managing change within a business environment, and focus on the difficulties of managing changes that are caused by external parties in business-tobusiness (B2B) information exchanges.
Efficient web change monitoring with page digest.
The Internet and the World Wide Web have enabled a publishing explosion of useful online information, which has produced the unfortunate side effect of information overload: it is increasingly difficult for individuals to keep abreast of fresh information. In this paper we describe an approach for building a system for efficientlymonitoring changes to Web documents. This paper has three main contributions. First, we present a coherent framework that captures different characteristics of Web documents. The system uses the Page Digest encoding to provide a comprehensive monitoring system for content, structure, and other interesting properties of Web documents. Second, the Page Digest encoding enables improved performance for individual page monitors through mechanisms such as short-circuit evaluation, linear time algorithms for document and structure similarity, and data size reduction. Finally, we develop a collection of sentinel grouping techniques based on the Page Digest encoding to reduce redundant processing in large-scale monitoring systems by grouping similar monitoring requests together. We examine how effective these techniques are over a wide range of parameters and have seen an order of magnitude speed up over existing Web-based information monitoring systems.
An Expiration Age%2DBased Document Placement Scheme for Cooperative Web Caching.
Abstract—The sharing of caches among proxies is an important technique to reduce Web traffic, alleviate network bottlenecks, and improve response time of document requests. Most existing work on cooperative caching has been focused on serving misses collaboratively. Very few have studied the effect of cooperation on document placement schemes and its potential enhancements on cache hit ratio and latency reduction. In this paper, we propose a new document placement scheme which takes into account the contentions at individual caches in order to limit the replication of documents within a cache group and increase document hit ratio. The main idea of this new scheme is to view the aggregate disk space of the cache group as a global resource of the group and uses the concept of cache expiration age to measure the contention of individual caches. The decision of whether to cache a document at a proxy is made collectively among the caches that already have a copy of this document. We refer to this new document placement scheme as the Expiration Age-based scheme (EA scheme for short). The EA scheme effectively reduces the replication of documents across the cache group, while ensuring that a copy of the document always resides in a cache where it is likely to stay for the longest time. We report our study on the potentials and limits of the EA scheme using both analytic modeling and trace-based simulation. The analytical model compares and contrasts the existing (ad hoc) placement scheme of cooperative proxy caches with our new EA scheme and indicates that the EA scheme improves the effectiveness of aggregate disk usage, thereby increasing the average time duration for which documents stay in the cache. The trace-based simulations show that the EA scheme yields higher hit rates and better response times compared to the existing document placement schemes used in most of the caching proxies. Index Terms—Cooperative Web caching, document placement, distributed caching. 1
PeerTrust Supporting Reputation%2DBased Trust for Peer%2Dto%2DPeer Electronic Communities.
Peer-to-peer (P2P) online communities are commonly perceived as an environment offering both opportunities and threats.
VISTA validating and refining clusters via visualization.
Clustering is an important technique for understanding of large multi-dimensional datasets. Most of clustering research to date has been focused on developing automatic clustering algorithms and cluster validation methods. The automatic algorithms are known to work well in dealing with clusters of regular shapes, e.g. compact spherical shapes, but may incur higher error rates when dealing with arbitrarily shaped clusters. Although some efforts have been devoted to addressing the problem of skewed datasets, the problem of handling clusters with irregular shapes is still in its infancy, especially in terms of dimensionality of the datasets and the precision of the clustering results considered. Not surprisingly, the statistical indices works ineffective in validating clusters of irregular shapes, too. In this paper, we address the problem of clustering and validating arbitrarily shaped clusters with a visual framework (VISTA). The main idea of the VISTA approach is to capitalize on the power of visualization and interactive feedbacks to encourage domain experts to participate in the clustering revision and clustering validation process. The VISTA system has two unique features. First, it implements a linear and reliable visualization model to interactively visualize multi-dimensional datasets in a 2D star-coordinate space. Second, it provides a rich set of user-friendly interactive rendering operations, allowing users to validate and refine the cluster structure based on their visual experience as well as their domain knowledge.
Adaptation Space A Design Framework for Adaptive Web Services.
Web service adaptation is an important feature for mission  critical Web services. It is widely recognized that thrashing and crashes  occur in system saturation for many statically adaptive resource  management algorithms, including CPU, memory, and network congestion.

A reputation%2Dbased trust model for peer%2Dto%2Dpeer ecommerce communities.

Editor%27s Notes.
Bereavement is a life transition or crisis faced by a significant number of undergraduates. Researchers have found that at any one point in time, approximately 25 percent of college students are in the first year of bereavement and almost 50 percent have experienced the death of a family member or friend within the past two years (Balk, 2001; Hardison, Neimeyer, and Lichstein, 2005). Death loss experiences and grief reactions have the potential to affect the day-to-day functioning and overall development of bereaved college students. In addition, campuses experience the deaths of members of their student body. The mortality rate for individuals between the ages of eighteen and twenty-four, when combined for both sexes and all races, is about 1 per 1,000 (Anderson and Smith, 2005). The rates are even higher for the older age groups that comprise the adult learner population (Minino and others, 2007). Despite the prevalence and significance of death issues on campus, the topics of death, grief, and bereavement are seldom addressed in the student
Editor%27s Notes.
Bereavement is a life transition or crisis faced by a significant number of undergraduates. Researchers have found that at any one point in time, approximately 25 percent of college students are in the first year of bereavement and almost 50 percent have experienced the death of a family member or friend within the past two years (Balk, 2001; Hardison, Neimeyer, and Lichstein, 2005). Death loss experiences and grief reactions have the potential to affect the day-to-day functioning and overall development of bereaved college students. In addition, campuses experience the deaths of members of their student body. The mortality rate for individuals between the ages of eighteen and twenty-four, when combined for both sexes and all races, is about 1 per 1,000 (Anderson and Smith, 2005). The rates are even higher for the older age groups that comprise the adult learner population (Minino and others, 2007). Despite the prevalence and significance of death issues on campus, the topics of death, grief, and bereavement are seldom addressed in the student
Editor%27s Notes.
Bereavement is a life transition or crisis faced by a significant number of undergraduates. Researchers have found that at any one point in time, approximately 25 percent of college students are in the first year of bereavement and almost 50 percent have experienced the death of a family member or friend within the past two years (Balk, 2001; Hardison, Neimeyer, and Lichstein, 2005). Death loss experiences and grief reactions have the potential to affect the day-to-day functioning and overall development of bereaved college students. In addition, campuses experience the deaths of members of their student body. The mortality rate for individuals between the ages of eighteen and twenty-four, when combined for both sexes and all races, is about 1 per 1,000 (Anderson and Smith, 2005). The rates are even higher for the older age groups that comprise the adult learner population (Minino and others, 2007). Despite the prevalence and significance of death issues on campus, the topics of death, grief, and bereavement are seldom addressed in the student
A reputation%2Dbased trust model for peer%2Dto%2Dpeer ecommerce communities.

Design Retargetable Platform System for Microprocessor Functional Test.

BioSeek Exploiting Source%2DCapability Information for Integrated Access to Multiple Bioinformatics Data Sources.

A Reputation%2DBased Trust Model for Peer%2Dto%2DPeer eCommerce Communities.
Peer-to-Peer eCommerce communities are commonly perceived as an environment offering both opportunities and threats. One way to minimize threats in such an open community is to use community-based reputations, which can be computed, for example, through feedback about peers&#039; transaction histories. Such reputation information can help estimating the trustworthiness and predicting the future behavior of peers. This paper presents a coherent adaptive trust model for quantifying and comparing the trustworthiness of peers based on a transaction-based feedback system. There are two main features of our model. First, we argue that the trust models based solely on feedback from other peers in the community is inaccurate and ineffective. We introduce three basic trust parameters in computing trustworthiness of peers. In addition to feedback a peer receives through its transactions with other peers, we incorporate the total number of transactions a peer performs, and the credibility of the feedback sources into the model for evaluating the trustworthiness of peers. Second, we introduce two adaptive factors, the transaction context factor and the community context factor, to allow the metric to adapt to different domains and situations and to address common problems encountered in a variety of online communities. We also developed a concrete method to validate the proposed trust model and obtained initial results, showing the feasibility and benefit of our approach.
Page Digest for Large%2DScale Web Services.
The rapid growth of the World Wide Web and the Internet has fueled interest in Web services and the  Semantic Web, which are quickly becoming important parts of modern electronic commerce systems. An  interesting segment of the Web services domain are the facilities for document manipulation including  Web search, information monitoring, data extraction, and page comparison. These services are built  on common functional components that can preprocess large numbers of Web pages, parsing them into  internal storage and processing formats. If a Web service is to operate on the scale of the Web, it must  handle this storage and processing efficiently.
Techniques for efficient fragment detection in web pages.

Apoidea A Decentralized Peer%2Dto%2DPeer Architecture for Crawling the World Wide Web.
Abstract. 1 This paper describes a decentralized peer-to-peer model for building a Web crawler. Most of the current systems use a centralized client-server model, in which the crawl is done by one or more tightly coupled machines, but the distribution of the crawling jobs and the collection of crawled results are managed in a centralized system using a centralized URL repository. Centralized solutions are known to have problems like link congestion, being a single point of failure, and expensive administration. It requires both horizontal and vertical scalability solutions to manage Network File Systems (NFS) and load balancing DNS and HTTP requests. In this paper, we present an architecture of a completely distributed and decentralized Peer-to-Peer (P2P) crawler called Apoidea, which is self-managing and uses geographical proximity of the web resources to the peers for a better and faster crawl. We use Distributed Hash Table (DHT) based protocols to perform the critical URL-duplicate and content-duplicate tests. 1
The Availability Semantics of Predicate Data Flow Diagram.

Free Riding A New Challenge to Peer%2Dto%2DPeer File Sharing Systems.
Most of the research in the field of peer-to-peer file sharing systems has concentrated on performance issues such as efficient file lookup, replicating files to improve file download speeds etc. However there is a new challenge that questions the very existence and usefulness of such systems in the form of &#034;Free Riding&#034;. This paper studies the seriousness of the negative impact that free riding can have in a P2P file sharing system. We introduce the concept of utility function to measure the usefulness of peers to the system as a whole, and describe a scheme based on this concept to control free riding. A simple utility function is described to illustrate the scheme. We design and develop a simulation model to study various patterns of sharing behaviors among the peers in a file sharing community and their impact on the system. A set of experimental results is reported. The experiments indicate that the utility based free riding control can increase the lifetime of the system by 10 times, even with a simple utility function.
PeerCQ A Decentralized and Self%2DConfiguring Peer%2Dto%2DPeer Information Monitoring System.
PeerCQ is a totally decentralized system that performs information monitoring tasks over a network of peers with heterogeneous capabilities. It uses Continual Queries (CQs) as its primitives to express informationmonitoring requests. A primary objective of the PeerCQ system is to build a decentralized Internet scale distributed information-monitoring system, which is highly scalable, self-configurable and supports e#cient and robust way of processing CQs. This paper describes the basic architecture of the PeerCQ system and focuses on the mechanisms used for service partitioning at the P2P protocol layer. A set of initial experiments is reported, demonstrating the sensitiveness of the PeerCQ approach to large scale P2P information monitoring and the e#ectiveness of the PeerCQ service-partitioning algorithms with respect to load balancing and system utilization.
Validating and Refining Clusters via Visual Rendering.
Clustering is an important technique for understanding and analysis of large multi-dimensional datasets in many scientific applications. Most of clustering research to date has been focused on developing automatic clustering algorithms or cluster validation methods. The automatic algorithms are known to work well in dealing with clusters of regular shapes, e.g. compact spherical shapes, but may incur higher error rates when dealing with arbitrarily shaped clusters. Although some efforts have been devoted to addressing the problem of skewed datasets, the problem of handling clusters with irregular shapes is still in its infancy, especially in terms of dimensionality of the datasets and the precision of the clustering results considered. Not surprisingly, the statistical indices works ineffective in validating clusters of irregular shapes, too. In this paper, we address the problem of cluster rendering of skewed datasets by introducing a series of visual rendering techniques and a visual framework (VISTA). A main idea of the VISTA approach is to capitalize on the power of visualization and interactive feedbacks to encourage domain experts to participate in the clustering revision and clustering validation process. The VISTA system has two unique features. First, it implements a linear and reliable mapping model to visualize k-dimensional data sets in a 2D star-coordinate space. Second, it provides a rich set of userfriendly and yet effective interactive rendering operations, allowing users to validate and interactively refine the cluster structure based on their visual experience as well their domain knowledge.
Adaptation Space A Design Framework for Adaptive Web Services.
Web service adaptation is an important feature for mission  critical Web services. It is widely recognized that thrashing and crashes  occur in system saturation for many statically adaptive resource  management algorithms, including CPU, memory, and network congestion.
Trigger Grouping A Scalable Approach to Large Scale Information Monitoring.
Information change monitoring services are becoming increasingly useful as more and more information is published on the Web. A major research challenge is how to make the service scalable to serve millions of monitoring requests. Such services usually use soft triggers to model users&#039; monitoring requests. We have developed an effective trigger grouping scheme to optimize the trigger processing. The main idea behind this scheme is to reduce repeated computation by grouping monitoring requests of similar structures together. In this paper, we evaluate our approach using both measurements on real systems and simulations. The study shows significant performance gains using the trigger grouping approach. Moreover, the gains are critically dependent on group size and group size distribution (e.g., Zipf). We also discuss the benefit, trade-off, and runtime characteristics of the proposed approach.
TrustMe Anonymous Management of Trust Relationships in Decentralized P2P Systems.
Decentralized Peer to Peer (P2P) networks offer both opportunities and threats. Its open and decentralized nature makes it extremely susceptible to malicious users spreading harmful content like viruses, trojans or, even just wasting valuable resources of the network. In order to minimize such threats, the use of community-based reputations as trust measurements is fast becoming a de-facto standard. The idea is to dynamically assign each peer a trust rating based on its performance in the network and store it at a suitable place. Any peer wishing to interact with another peer can make an informed decision based on such a rating.
Connectivity Based Node Clustering in Decentralized Peer%2Dto%2DPeer Networks.
Connectivity based node clustering has wide ranging applications in decentralized Peer-to-Peer (P2P) networks such as P2P file sharing systems, mobile ad-hoc networks, P2P sensor networks and so forth. This paper describes a Connectivity-based Distributed Node Clustering scheme (CDC). This scheme presents a scalable and an efficient solution for discovering connectivity based clusters in peer networks. In contrast to centralized graph clustering algorithms, the CDC scheme is completely decentralized and it only assumes the knowledge of neighbor nodes, instead of requiring a global knowledge of the network (graph) to be available. An important feature of the CDC scheme is its ability to cluster the entire network automatically or to discover clusters around a given set of nodes. We provide detailed experimental evaluations of the CDC scheme, addressing its effectiveness in discovering good quality clusters. Our experiments show that utilizing message-based connectivity structure can considerably reduce the messaging cost, and provide better utilization of resources, which in turn improves the quality of service of the applications executing over decentralized peer-to-peer networks.
Distributed Query Adaptation and Its Trade%2Doffs.
Adaptive query processing in large distributed systems has seen increasing importance due to the rising environmental fluctuations in a growing Internet. We describe Ginga, an adaptive query processing engine that combines proactive (compile-time) alternative query plan generation with reactive (run-time) monitoring of network delays. The core of Ginga approach is the notion of adaptation space and mechanisms for coordinating and integrating di#erent kinds of query adaptation. An adaptation space consists of a set of adaptation triggers and a set of adaptation cases associated with the triggers. Each adaptation case describes a specific adaptation opportunity of the query execution when changes to the runtime environment are detected. Our experimental results show that Ginga query adaptation can achieve significant performance improvements (up to 40% of response time gain) for processing distributed queries over the Internet. Categories and Subject Descriptors  H.2.4 [Systems]: Query Processing; H.1.0 [Models and Principles]: General.
Cluster Rendering of Skewed Datasets via Visualization.
Information Visualization is commonly recognized as a useful method for understanding sophistication in large datasets. In this paper, we introduce a flexible clustering approach with visualization techniques, aiming at the datasets that have skewed cluster distribution. This paper has three contributions. First, we propose a framework Vista that incorporates information visualization methods into the clustering process in order to enhance the understanding of the intermediate clustering results and allow user to revise the clustering results easily. Second, we develop a visualization model that maps multidimensional dataset to 2D visualizations while preserving or partially preserving clusters. Third, based on the visualization model, a set of operating rules are proposed to guide the user rendering clusters efficiently. Experiments show that the Vista system can yield lower error rates for real datasets than typical automated algorithms.
Using Domain Ontologies to Help Track Data Provenance.

Reliable Peer%2Dto%2DPeer Information Monitoring through Replication.
A key challenge in peer-to-peer computing systems is to provide a decentralized and yet reliable service on top of a network of loosely coupled, weakly connected and possibly unreliable peers. This paper presents an effective dynamic passive replication scheme designed to provide reliable service in PeerCQ, a decentralized and self-configurable peer-to-peer Internet information monitoring system. We first describe the design of a distributed replication scheme, which enables reliable processing of long-running information monitoring requests in an environment of inherently unreliable peers. Then we present an analytical model to discuss its fault tolerance properties. A set of initial experiments is reported, showing the feasibility and the effectiveness of the proposed approach.
A Modeling and Execution Environment for Distributed Scientific Workflows.
The Scientific Data Management Center project is part of a large research program to enable scientific discovery through advanced computing. This demonstration illustrates how a domain scientist can perform a complex scientific task by interleaving data access, querying, and manipulation, as well as analytical steps and computations in complex, problem specific ways. We show how our system is used by a geneticist for solving the problem of discovering so-called `co-regulated&#039; genes by interlinking data and computation from several web sites, local computations, as well as local and remote databases. Themain distinctive features of our system include (i) executable workflows run as web services, (ii) abstract workflows employ concept names and semantic types that are higher-level (and thus more `scientist-friendly&#039;) than executable workflows, and (iii) our system supports automatic translation of the latter into the former.
A Visual Framework Invites Human into the Clustering Process.
Clustering is a technique commonly used in scientific research. The task of clustering inevitably involves human participation – The clustering is not finished when the computer/algorithm finishes but the user has evaluated, understood and accepted the patterns. This defines a human involved “clusteringanalysis/evaluation” iteration. Instead of neglecting this human involvement, we provide a visual framework (VISTA) with all power of algorithmic approaches (since their result can be visualized), and in addition we allow the user to steer/monitor/refine the clustering process with domain knowledge. The visual-rendering result also provides a precise pattern for fast post-processing.
Towards Flexible Specification

A computationally efficient particle%2Dpuff model for concentration variance from steady releases.

Editor%27s Notes.
Bereavement is a life transition or crisis faced by a significant number of undergraduates. Researchers have found that at any one point in time, approximately 25 percent of college students are in the first year of bereavement and almost 50 percent have experienced the death of a family member or friend within the past two years (Balk, 2001; Hardison, Neimeyer, and Lichstein, 2005). Death loss experiences and grief reactions have the potential to affect the day-to-day functioning and overall development of bereaved college students. In addition, campuses experience the deaths of members of their student body. The mortality rate for individuals between the ages of eighteen and twenty-four, when combined for both sexes and all races, is about 1 per 1,000 (Anderson and Smith, 2005). The rates are even higher for the older age groups that comprise the adult learner population (Minino and others, 2007). Despite the prevalence and significance of death issues on campus, the topics of death, grief, and bereavement are seldom addressed in the student
Editor%27s Notes.
Bereavement is a life transition or crisis faced by a significant number of undergraduates. Researchers have found that at any one point in time, approximately 25 percent of college students are in the first year of bereavement and almost 50 percent have experienced the death of a family member or friend within the past two years (Balk, 2001; Hardison, Neimeyer, and Lichstein, 2005). Death loss experiences and grief reactions have the potential to affect the day-to-day functioning and overall development of bereaved college students. In addition, campuses experience the deaths of members of their student body. The mortality rate for individuals between the ages of eighteen and twenty-four, when combined for both sexes and all races, is about 1 per 1,000 (Anderson and Smith, 2005). The rates are even higher for the older age groups that comprise the adult learner population (Minino and others, 2007). Despite the prevalence and significance of death issues on campus, the topics of death, grief, and bereavement are seldom addressed in the student
Editor%27s Notes.
Bereavement is a life transition or crisis faced by a significant number of undergraduates. Researchers have found that at any one point in time, approximately 25 percent of college students are in the first year of bereavement and almost 50 percent have experienced the death of a family member or friend within the past two years (Balk, 2001; Hardison, Neimeyer, and Lichstein, 2005). Death loss experiences and grief reactions have the potential to affect the day-to-day functioning and overall development of bereaved college students. In addition, campuses experience the deaths of members of their student body. The mortality rate for individuals between the ages of eighteen and twenty-four, when combined for both sexes and all races, is about 1 per 1,000 (Anderson and Smith, 2005). The rates are even higher for the older age groups that comprise the adult learner population (Minino and others, 2007). Despite the prevalence and significance of death issues on campus, the topics of death, grief, and bereavement are seldom addressed in the student
Editor%27s Notes.
Bereavement is a life transition or crisis faced by a significant number of undergraduates. Researchers have found that at any one point in time, approximately 25 percent of college students are in the first year of bereavement and almost 50 percent have experienced the death of a family member or friend within the past two years (Balk, 2001; Hardison, Neimeyer, and Lichstein, 2005). Death loss experiences and grief reactions have the potential to affect the day-to-day functioning and overall development of bereaved college students. In addition, campuses experience the deaths of members of their student body. The mortality rate for individuals between the ages of eighteen and twenty-four, when combined for both sexes and all races, is about 1 per 1,000 (Anderson and Smith, 2005). The rates are even higher for the older age groups that comprise the adult learner population (Minino and others, 2007). Despite the prevalence and significance of death issues on campus, the topics of death, grief, and bereavement are seldom addressed in the student
POESIA An ontological workflow approach for composing Web services in agriculture.

Ginga a self%2Dadaptive query processing system.
INTRODUCTION  Adaptive query processing in wide area distributed systems has received significant attention due to the dynamics of the Internet. Ginga is a project currently ongoing at Georgia Institute of Technology aiming at studying the research issues in building a self-adaptive query processing system. We identify three important failure modes for executing queries on the Internet: network delays [1], memory shortage, and sudden unavailability of remote data servers. This extended abstract will give a brief overview of the design of Ginga system and illustrate the proposed adaptation framework using a network delay scenario as example.  A query processing system is called adaptive if it has the following two characteristics. First, it collects information about its runtime environment and uses this information to determine its subsequent behavior. Second, this information collection and behavior revision process iterates over time, generating feedback loop between the runtime envi
A New Document Placement Scheme for Cooperative Caching on the Internet.
Most existing work on cooperative caching has been focused on serving misses collaboratively. Very few have studied the effect of cooperation on document placement schemes and its potential enhancements on cache hit ratio and latency reduction. In this paper we propose a new document placement scheme called the EA Scheme, which takes into account the contentions at individual caches in order to limit the replication of documents within a cache group and increase document hit ratio. The main idea of this new scheme is to view the aggregate disk space of the cache group as a global resource of the group, and uses the concept of cache expiration age to measure the contention of individual caches. The decision of whether to cache a document at a proxy is made collectively among the caches that already have a copy of this document. The experiments show that the EA scheme yields higher hit rates and better response times compared to the existing document placement schemes used in most of the caching proxies. 1.
A Framework for Specification%2DBased Class Testing.

Formalizing UML Models with Object%2DZ.

Editor%27s Notes.
Bereavement is a life transition or crisis faced by a significant number of undergraduates. Researchers have found that at any one point in time, approximately 25 percent of college students are in the first year of bereavement and almost 50 percent have experienced the death of a family member or friend within the past two years (Balk, 2001; Hardison, Neimeyer, and Lichstein, 2005). Death loss experiences and grief reactions have the potential to affect the day-to-day functioning and overall development of bereaved college students. In addition, campuses experience the deaths of members of their student body. The mortality rate for individuals between the ages of eighteen and twenty-four, when combined for both sexes and all races, is about 1 per 1,000 (Anderson and Smith, 2005). The rates are even higher for the older age groups that comprise the adult learner population (Minino and others, 2007). Despite the prevalence and significance of death issues on campus, the topics of death, grief, and bereavement are seldom addressed in the student
Editor%27s Notes.
Bereavement is a life transition or crisis faced by a significant number of undergraduates. Researchers have found that at any one point in time, approximately 25 percent of college students are in the first year of bereavement and almost 50 percent have experienced the death of a family member or friend within the past two years (Balk, 2001; Hardison, Neimeyer, and Lichstein, 2005). Death loss experiences and grief reactions have the potential to affect the day-to-day functioning and overall development of bereaved college students. In addition, campuses experience the deaths of members of their student body. The mortality rate for individuals between the ages of eighteen and twenty-four, when combined for both sexes and all races, is about 1 per 1,000 (Anderson and Smith, 2005). The rates are even higher for the older age groups that comprise the adult learner population (Minino and others, 2007). Despite the prevalence and significance of death issues on campus, the topics of death, grief, and bereavement are seldom addressed in the student
Editor%27s Notes.
Bereavement is a life transition or crisis faced by a significant number of undergraduates. Researchers have found that at any one point in time, approximately 25 percent of college students are in the first year of bereavement and almost 50 percent have experienced the death of a family member or friend within the past two years (Balk, 2001; Hardison, Neimeyer, and Lichstein, 2005). Death loss experiences and grief reactions have the potential to affect the day-to-day functioning and overall development of bereaved college students. In addition, campuses experience the deaths of members of their student body. The mortality rate for individuals between the ages of eighteen and twenty-four, when combined for both sexes and all races, is about 1 per 1,000 (Anderson and Smith, 2005). The rates are even higher for the older age groups that comprise the adult learner population (Minino and others, 2007). Despite the prevalence and significance of death issues on campus, the topics of death, grief, and bereavement are seldom addressed in the student
Editor%27s Notes.
Bereavement is a life transition or crisis faced by a significant number of undergraduates. Researchers have found that at any one point in time, approximately 25 percent of college students are in the first year of bereavement and almost 50 percent have experienced the death of a family member or friend within the past two years (Balk, 2001; Hardison, Neimeyer, and Lichstein, 2005). Death loss experiences and grief reactions have the potential to affect the day-to-day functioning and overall development of bereaved college students. In addition, campuses experience the deaths of members of their student body. The mortality rate for individuals between the ages of eighteen and twenty-four, when combined for both sexes and all races, is about 1 per 1,000 (Anderson and Smith, 2005). The rates are even higher for the older age groups that comprise the adult learner population (Minino and others, 2007). Despite the prevalence and significance of death issues on campus, the topics of death, grief, and bereavement are seldom addressed in the student
Querying Multiple Bioinformatics Data Sources Can Semantic Web Research Help%3F

Information Modelling on the Web A Scalable Solution.

Eleventh International Workshop on Research Issues in Data Engineering Document Management for Data Intensive Business and Scientific Applications

Z User Studio An Integrated Support Tool for Z Specifications.

A Fully Automated Object Extraction System for the World Wide Web.
This paper presents a fully automated object extraction system  \Gamma Omini. A distinct feature of Omini is the suite of algorithms and the automatically learned information extraction rules for discovering and extracting objects from dynamic Web pages or static Web pages that contain multiple object instances. We evaluated the system using more than 2,000 Web pages over 40 sites. It achieves 100% precision (returns only correct objects) and excellent recall (between 93% and 98%, with very few significant objects left out). The object boundary identification algorithms are fast, about 0.1 second per page with a simple optimization.
OminiSearch A Method for Searching Dynamic Content on the Web.

An XML%2Denabled data extraction toolkit for web sources.

Editor%27s Notes.
Bereavement is a life transition or crisis faced by a significant number of undergraduates. Researchers have found that at any one point in time, approximately 25 percent of college students are in the first year of bereavement and almost 50 percent have experienced the death of a family member or friend within the past two years (Balk, 2001; Hardison, Neimeyer, and Lichstein, 2005). Death loss experiences and grief reactions have the potential to affect the day-to-day functioning and overall development of bereaved college students. In addition, campuses experience the deaths of members of their student body. The mortality rate for individuals between the ages of eighteen and twenty-four, when combined for both sexes and all races, is about 1 per 1,000 (Anderson and Smith, 2005). The rates are even higher for the older age groups that comprise the adult learner population (Minino and others, 2007). Despite the prevalence and significance of death issues on campus, the topics of death, grief, and bereavement are seldom addressed in the student
Editor%27s Notes.
Bereavement is a life transition or crisis faced by a significant number of undergraduates. Researchers have found that at any one point in time, approximately 25 percent of college students are in the first year of bereavement and almost 50 percent have experienced the death of a family member or friend within the past two years (Balk, 2001; Hardison, Neimeyer, and Lichstein, 2005). Death loss experiences and grief reactions have the potential to affect the day-to-day functioning and overall development of bereaved college students. In addition, campuses experience the deaths of members of their student body. The mortality rate for individuals between the ages of eighteen and twenty-four, when combined for both sexes and all races, is about 1 per 1,000 (Anderson and Smith, 2005). The rates are even higher for the older age groups that comprise the adult learner population (Minino and others, 2007). Despite the prevalence and significance of death issues on campus, the topics of death, grief, and bereavement are seldom addressed in the student
Editor%27s Notes.
Bereavement is a life transition or crisis faced by a significant number of undergraduates. Researchers have found that at any one point in time, approximately 25 percent of college students are in the first year of bereavement and almost 50 percent have experienced the death of a family member or friend within the past two years (Balk, 2001; Hardison, Neimeyer, and Lichstein, 2005). Death loss experiences and grief reactions have the potential to affect the day-to-day functioning and overall development of bereaved college students. In addition, campuses experience the deaths of members of their student body. The mortality rate for individuals between the ages of eighteen and twenty-four, when combined for both sexes and all races, is about 1 per 1,000 (Anderson and Smith, 2005). The rates are even higher for the older age groups that comprise the adult learner population (Minino and others, 2007). Despite the prevalence and significance of death issues on campus, the topics of death, grief, and bereavement are seldom addressed in the student
WebCQ Detecting and Delivering Information Changes on the Web.
WebCQ is a prototype system for large-scale Web information monitoring and delivery. It makes heavy use of the structure presentinhypertext and the concept of continual queries. In this paper we discuss both mechanisms that WebCQ uses to discover and detect changes to the World Wide Web (the Web) pages efficiently, and the methods to notify users of interesting changes with a personalized customization. The WebCQ system consists of four main components: achange detection robot that discovers and detects changes, a proxy cache service that reduces communication traffics to the original information servers, a personalized presentation tool that highlights changes detected byWebCQ sentinels, and a change notification service that delivers fresh information to the right users at the right time. A salient feature of our change detection robot is its ability to support various types of web page sentinels for detecting, presenting, and delivering interesting changes to web pages. This paper describes the WebCQ system with an emphasis on general issues in designing and engineering a large-scale information change monitoring system on the Web.
XWRAP An XML%2DEnabled Wrapper Construction System for Web Information Sources.
The amount of useful semi-structured data on the web continues to grow at a stunning pace. Often interesting web data are not in database systems but in HTML pages, XML pages, or text les. Data in these formats is not directly usable by standard SQL-like query processing engines that support sophisticated querying and reporting beyond keyword-based retrieval. Hence, the web users or applications need a smart way of extracting data from these web sources. One of the popular approaches is to write wrappers around the sources, either manually or with software assistance, to bring the web data within the reach of more sophisticated query tools and general mediator-based information integration systems. In this paper, we describe the methodology and the software development of an XML-enabled wrapper construction system- XWRAP for semi-automatic generation of wrapper programs. By XML-enabled we mean that the metadata about information content that are implicit in the original web pages will be extracted and encoded explicitly as XML tags in the wrapped documents. In addition, the query-based content ltering process is performed against the XML documents. The XWRAP wrapper generation framework has three distinct features. First, it explicitly separates
A Test Class Framework for Generating Test Cases from Z Specifications.

AQR%2DToolkit An Adaptive Query Routing Middleware for Distributed Data Intensive Systems.

Correction to %60%60Continual Queries for Internet Scale Event%2DDriven Information Delivery%27%27.

InfoFilter Supporting Quality of Service for Fresh Information Delivery.
With the explosivegrowthoftheInternet and World Wide Web  comes a dramatic increase in the number of users that compete for the shared  resources of distributed system environments. Most implementations of application  servers and distributed search software do not distinguish among requests to  differentweb pages. This has the implication that the behavior of application  servers is quite unpredictable. Applications that require timely delivery of fresh  information consequently suffer the most in such competitiveenvironments. This  paper presents a model of quality of service (QoS) and the design of a QoS-enabled  information delivery system that implements such a QoS model. The goal of this  developmentistwo-fold. On one hand, wewant to enable users or applications  to specify the desired quality of service requirements for their requests so that  application-aware QoS adaptation is supported throughout the Web query and  search processing. On the other hand, wewant to enable an application server to  customize how it should respond to external requests by setting priorities among  query requests and allocating server resources using adaptive QoS control mechanisms.
An Approach to Testing the Nonexistence of Initial State in Z Specifications.

Quality of Service Semantics for Multimedia Database Systems.
Quality of service (QoS) support has been a hot research topic in multimedia databases, and multimedia systems in general, for the past several years. However, there remains little consensus on how QoS support should be provided. At the resource-management level, systems designers are still debating the suitability of reservation-based versus adaptive QoS management. The design of higher system layers is less clearly understood, and the specification of QoS requirements in domain-specific terms is still an open research topic. To address these issues, we propose a QoS model for multimedia databases. The model covers the specification of user-level QoS preferences and their relationship to QoS control at the resource-management level, and is applicable to adaptive and reservation-based systems. In this paper we present the model, discuss the implications it has for multimedia database design, and describe a practical implementation of it. 1
Query Routing in Large%2DScale Digital Library Systems.
Modern digital libraries require user-friendly and yet responsive access to the rapidly growing, heterogeneous,  and distributed collection of information sources. However, the increasing volume and  diversity of digital information available online have led to a growing problem that conventional data  management systems do not have, namely #nding which information sources out of many candidate  choices are the most relevant to answer a given user query.We refer to this problem as the query  routing problem.
Supporting Internet Applications beyond Browsing Trigger Processing and Change Notification %28Extended Abstract%29.
This paper presents the design and implementation methodology of the JCQ system, a Java-based Continual Query system for update monitoring over Web information sources. A continual query is a standing query that monitors updates of interest using distributed triggcrs and notifies users whenever the updates reach specified thresholds.
An XML%2Dbased Wrapper Generator for Web Information Extraction.
Introduction  There has been tremendous interest in information integration systems that automatically gather, manipulate, and integrate data from multiple information sources on a user&#039;s behalf. Unfortunately, web sites are primarily designed for human browsing rather than for use by a computer program. Mechanically extracting their content is in general a rather difficult job if not impossible [4]. Software systems using such web information sources typically use hand-coded  wrappers to extract information content of interest from web sources and translate query responses to a more structured format (e.g., relational form) before unifying them into an integrated answer to a user&#039;s query. The most recent generation of information mediator systems (e.g., Ariadne [3], CQ [5, 7], Internet Softbots [4], TSIMMIS [2]) addresses this problem by enabling a pre-wrapped set of web sources to be accessed via database-like queries. However, hand-coding a wrapper is time con
TAM A System for Dynamic Transactional Activity Management.
Introduction  Electronic commerce (EC) has remarkably reshaped today&#039;s business practices. The logic embedded in business transactions are becoming more flexible and sophisticated; the number of components within these business transactions are fastly increasing; and business transactions are getting more distributed and interactive as well. These, on the other hand, make today&#039;s business applications more vulnerable to resource availability constraints and consistency problems due to failures. For example, network congestion, server overload, user absence, and other exceptions all might cause temporary or permanent bottlenecks to ongoing business workflows. Developing system support to make workflow activities more reliable, efficient, and adaptive to changes or exceptions therefore poses important yet challenging questions that call for practical solutions.  The TAM project at OGI aims at developing a flexible framework and algorithms that address these challenges. Comparing 
Continual Queries for Internet Scale Event%2DDriven Information Delivery.
In this paper we introduce the concept of continual queries, describe the design of a distributed  event-driven continual query system -- OpenCQ, and outline the initial implementation of OpenCQ  on top of the distributed interoperable information mediation system DIOM [21, 19]. Continual  queries are standing queries that monitor update of interest and return results whenever the update  reaches specified thresholds. In OpenCQ, users may specify to the system the information they would  like to monitor (such as the events or the update thresholds they are interested in). Whenever the  information of interest becomes available, the system immediately delivers it to the relevant users;  otherwise, the system continually monitors the arrival of the desired information and pushes it to the  relevant users as it meets the specified update thresholds. In contrast to conventional pull-based data  management systems such as DBMSs and Web search engines, OpenCQ exhibits two important featu...
Type Safety in the Context of Method Updates.

Dynamic Restructuring of Transactional Workflow Activities A Practical Implementation Method.
We describe a practical method to implement the dynamic restructuring of distributed transactional activities with several main advantages. First, it guarantees the correctness of dynamic restructuring operations as well as that of ongoing transactional activities. Second, it is general enough to accommodate a wide range of workflow activities&#039; dynamic restructuring requirements. Third, it facilitates the deployment of dynamic restructuring operations on production systems. Our method combines adaptors, microprotocols, and incremental specialization, building modularly on the system components (e.g., RTF [1], OCP [28], MARS [4]) that we previously developed to support distributed extended transaction processing [19]. A prototype implementation based on this method is built on top of Transarc Encina, a commercial online transaction processing (OLTP) monitor. To our knowledge, this is the first implementation of dynamic restructuring on top of commercial OLTP systems.  1 Introduction  Ma...
EVOLVE Adaptive Specification Techniques for Object%2DOriented Software Evolution.

Methodical Restructuring of Complex Workflow Activities.
this paper due to the space restriction. Readers may refer to our technical report [13] for detail.
CQ A Personalized Update Monitoring Toolkit.
Introduction  The World Wide Web (WWW) made an unprecedented amount and variety of data accessible to all Internet users. However, users suffer from information starvation under this data overload, due to the daunting challenge of navigating, collecting, evaluating, and processing data in this dynamic and open information universe. The problem is aggravated when information changes constantly, but unpredictably. For example, as more aspects of business and commerce migrate online, system-supported update monitoring and event-driven information delivery becomes increasingly important because it reduces the time users spend hunting for the updated information as well as unnecessary traffic on the net. The CQ project at OGI, funded by DARPA, aims at developing a scalable toolkit and techniques for update monitoring and event-driven information delivery on the net. The main feature of the CQ project is a &#034;personalized update monitoring&#034; toolkit based on continual queries&lt;F2
Update Monitoring The CQ Project.
. In rapidly growing open environments such as the Internet, users experience information starvation in the midst of data overload, due to difficulties similar to finding the needle in a haystack. Update monitoring is a promising area of research where we bring the right information to the user at the right time, instead of forcing the user through manual browsing or repeated submission of queries. As an example of update monitoring research, we outline our work in the Continual Queries (CQ) project, including its basic concepts, software architecture, and current implementation status. 1 Introduction and Problem Statement  The World Wide Web (usually referred to as the Web) has made an enormous amount of data freely accessible over the Internet. However, finding the right information in the midst of this mountain of data has been likened to finding the proverbial needle in a haystack. This phenomenon has been called &#034;information starvation due to data overload.&#034;  2  Commonly used sear...
Evaluation of Declarative n%2DQueens Recursion A Deductive Database Approach.

Distributed Query Scheduling Service An Architecture and Its Implementation.
We present the systematic design and development of a distributed query scheduling service (DQS) in the context of DIOM, a distributed and interoperable query mediation system [26]. DQS consists of an extensible architecture for distributed query processing, a three-phase optimization algorithm for generating efficient query execution schedules, and a prototype implementation. Functionally, two important execution models of distributed queries, namely moving query to data or moving data to query, are supported and combined into a unified framework, allowing the data sources with limited search and filtering capabilities to be incorporated through wrappers into the distributed query scheduling process. Algorithmically, conventional optimization factors (such as join order) are considered separately from and refined by distributed system factors (such as data distribution, execution location, heterogeneous host capabilities), allowing for stepwise refinement through three optimization phases: compilation, parallelization, site selection and execution. A subset of DQS algorithms has been implemented in Java to demonstrate the practicality of the architecture and the usefulness of the distributed query scheduling algorithm in optimizing execution schedules for inter-site queries.
Accessing Heterogeneous Data Through Homogenization and Integration Mediators.
The AURORA mediator system employs a novel 2-tier, plug-and-play mediation model that is designed to facilitate access to a large number of heterogeneous data sources. This paper describes AURORA&#039;s mediation model and a suite of techniques used by a specific AURORA mediator, AURORA-RH. This suite includes a mediation methodology provided via an interactive mediator author&#039;s toolkit (MAT), a mediation enabling algebra, a query rewriting algorithm, and transformation rules that facilitate query optimization. 1. Introduction  The advent of the Internet gives rise to new types of applications such as electronic commerce and virtual enterprise that require integrated access to large number of heterogeneous data sources around the globe. Much is known about schema integration but the impact of this process on query processing efficiency is seldom discussed. In the Internet age, it is crucial that this impact be considered. The AURORA project builds integrated access to heterogeneous data sou...
ActivityFlow Towards Incremental Specification and Flexible Coordination of Workflow Activities.
. We introduce the ActivityFlow specification language for incremental  specification and flexible coordination of workflow activities.  The most interesting features of the ActivityFlow specification language  include (1) a collection of specification mechanisms, which provides a  workflow designer with a uniform workflow specification interface to  describe different types (i.e., ad-hoc, administrative, or production) of  workflows involved in their organizational processes, and helps to increase  the flexibility of workflow processes in accommodating changes; (2)  a set of activity modeling facilities, which enables the workflow designer  to describe the flow of work declaratively and incrementally, allowing  reasoning about correctness and security of complex workflow activities  independently from their underlying implementation mechanisms; (3) an  open architecture that supports user interaction as well as collaboration  of workflow systems of different organizations.  1 Introduc...
A Dynamic Query Scheduling Framework for Distributed and Evolving Information Systems.

Hooking into Object%2DOriented Application Frameworks.
An object-oriented application framework provides a generic design within a given domain and a reusable implementation of that design. Frameworks have great potential for reuse, but that potential can only be achieved if the framework can be understood and used effectively by application developers. The complexity of the design and implementation of a framework can make understanding the framework difficult, and so good documentation and guidance to the framework user is needed. Several methods exist for documenting the design of the framework, but less work has been done on documenting the purpose of the framework and how it is intended to be used. In this paper, we introduce the concept of hooks as a means of documenting and providing guidance on the intended use of a framework. Each hook provides a concise solution to a focused requirement or problem within the context of the framework. Solutions for more complex requirements can be provided by combining several hooks. A discussion ...
Mediator Join Indices.

Towards Interoperable Heterogeneous Information Systems An Experiment Using the DIOM Approach.

An Adaptive Object%2DOriented Approach to Integration and Access of Heterogeneous Information Sources.
A large-scale interoperable database system operating in a dynamic environment should provide Uniform  access to heterogeneous information sources, Scalability to the growing number of information  sources, Evolution and Composability of software and information sources, and Autonomy of participants,  both information consumers and information producers. We refer to these set of properties  as the USECA properties [30]. To address the research issues presented by such systems in a systematic  manner, weintroduce the Distributed Interoperable Object Model (DIOM). DIOM promotes  an adaptive approach to interoperation via intelligent mediation [46, 47], aimed at enhancing the  robustness and scalability of the services provided for integrating and accessing heterogeneous information  sources. DIOM&#039;s main features include [1] the recursive construction and organization  of information access through a network of application-specific mediators, [2] the explicit use of interface  composition meta operations (such as specialization, generalization, aggregation, import and  hide) to support the incremental design and construction of consumer&#039;s domain query model, [3] the  deferment of semantic heterogeneity resolution to the query result assembly time instead of before  or at the time of query formulation, and [4] the systematic development of the query mediation  framework and the procedure of each query processing step from query routing, query decomposition,  parallel access planning, query translation to query result assembly.To make DIOM concrete,  we outline the DIOM-based information mediation architecture, which includes important auxiliary  services such as domain-specific metadata library and catalog functions, object linking databases, and  associated query services. Seve...
Dynamic Query Processing in DIOM.
In an open environment such as the Internet, query responsiveness involves both the capability of responding  to a query within a reasonable time frame and the capability of dynamically incorporating the new information sources and the up to date information of existing data sources into the answer of a query. In this paper we present the dynamic distributed query processing framework, developed in the DIOM project, to demonstrate the feasibility and the benefit of improving responsiveness of querying across heterogeneous information sources, without relying on an integrated global view schema pre-defined over all the participating information sources. Then we discuss several issues with respect to improving query responsiveness in the context of DIOM, including how the information consumers&#039; queries are dynamically processed and linked to the relevant information sources, and how the query scheduling framework scales up in an environment where information sources accessible to users are constantly and rapidly changing, in their content, numbers, identity, and connectivity.  
The Role of Polymorphic Reuse Mechanisms in Schema Evolution in an Object%2DOriented Database.
A seamless approach to the incremental design and reuse of object-oriented methods and query specifications is presented. We argue for avoiding or minimizing the effort required for manually reprogramming methods and queries due to schema modifications, and demonstrate how the role of polymorphic reuse mechanisms is exploited for enhancing the adaptiveness of database programs against schema evolution in an object-oriented database. The salient features of our approach are the use of propagation patterns and a mechanism for propagation pattern refinement. Propagation patterns are employed as an interesting specification formalism for modeling operational requirements. They encourage the reuse of operational specifications against the structural modification of an object-oriented schema. Propagation pattern refinement is suited for the specification of reusable operational modules. It promotes the reusability of propagation patterns towards the operational  requirement changes. This app...
An Object%2DOriented Approach to Multi%2DLevel Association Rule Mining.

Issues on Query Processing in Distributed and Interoperable Information Systems.

An Adaptive Approach to Query Mediation Across Heterogeneous Information Sources.
We propose a query mediation framework to support customizable information gathering across heterogeneous and autonomous information sources. Instead of an integrated (and static) global schema, we propose an adaptive approach to interoperability which allows information consumers to represent their queries based on the customized personal view rather than a system-defined integrated view. The query mediation framework consists of five steps: query routing, query decomposition, parallel access plan generation, subquery translation and execution, and query result assembly. Concrete examples illustrate the challenges arising from heterogeneity in these five steps and how the framework scales up as the number of information sources grow and evolve. 1 Introduction  Large-scale cooperative information systems often require information consumers and information producers to cooperate across departmental, organizational, and national boundaries. The goal of cooperation is to increase producti...
Differential Evaluation of Continual Queries.
Information Superhighway environments such as the Internet have brought us ready access to large amount of information. However, Internet data is notoriously unorganized and autonomously managed in a distributed fashion. Large scale information monitoring in the Internet environment requires support beyond traditional database techniques. Two of the key issues are the increasing reward in monitoring a fast growing information base and the similarly increasing processing cost. To improve the expressiveness of queries for information monitoring, we define continual queries as a useful tool for monitoring of updated information. Continual queries are standing queries that monitor the source data and notify the users whenever new data matches the query. In addition to periodic refresh, continual queries include Epsilon Transaction concepts to allow users to specify query refresh based on the magnitude of updates. To support efficient processing of continual queries, we propose a different...
An Object%2DOriented Approach to Interoperation of Heterogeneous Information Sources.

Adaptable
Many different approaches have been applied to constraint satisfaction. These range from complete backtracking algorithms to sophisticated distributed configurations. However, most research effort in the field of constraint satisfaction algorithms has concentrated on the use of a single algorithm for solving all problems. At the same time, a consensus appears to have developed to the effect that it is unlikely that any single algorithm is always the best choice for all classes of problem. In this paper we argue that an adaptive approach should play an important part in constraint satisfaction. This approach relaxes the commitment to using a single algorithm once search commences. As a result, we claim that it is possible to undertake a more focused approach to problem solving, allowing for the correction of bad algorithm choices and for capitalising on opportunities for gain by dynamically changing to more suitable candidates.
The Building Blocks for Specifying Communication Behavior of Complex Objects An Activity%2DDriven Approach.
Communication behavior represents dynamic evolution and cooperation of a group of objects in accomplishing a task. It is an important feature in object-oriented systems. We propose the concept of activity as a basic building block for declarative specification of communication behavior in object-oriented database systems, including the temporal ordering of message exchanges within object communication and the behavioral relationships between activity executions. We formally introduce two kinds of activity composition mechanisms: activity specialization and activity aggregation for abstract implementation of communication behavior. The former is suited for behavioral refinement of existing activities into specialized activities. The latter is used for behavioral composition of simpler activities into complex activities, and ultimately, into the envisaged database system. We use First-Order Temporal Logic as an underlying formalism for specification of communication constraints. The well...
The Distributed Interoperable Object Model and Its Application to Large%2Dscale Interoperable Database Systems.
A large-scale interoperable database system operating in a dynamic environment should provide uniform  access user interface to its components, scalability to larger networks, evolution of database  schema and applications, flexible composability of client and server components, and preserve component  autonomy. To address the research issues presented by such systems, we introduce the  Distributed Interoperable Object Model (DIOM). DIOM&#039;s main features include the explicit repre-  sentation of and access to semantics in data sources through the DIOM base interfaces, the use of  interface abstraction mechanisms (such as specialization, generalization, aggregation and import) to  support incremental design and construction of compound interoperation interfaces, the deferment  of conflict resolution to the query submission time instead of at the time of schema integration, and  a clean interface between distributed interoperable objects that supports the independent evolution  and management of such objects. To make DIOM concrete, we outline the Diorama architecture,  which includes important auxiliary services such as domain-specific library functions, object linking  databases, and query decomposition and packaging strategies. Several practical examples and appli-  cation scenarios illustrate the usefulness of DIOM.
Maintaining Database Consistency in the Presence of Schema Evolution.
With rapid advances in computer network technology and the increasing interest in global information sharing, grows the need for facilities that can effectively maintain the database consistency and program compatibility as the schema evolves. In this paper, we present a general framework based on versions of schema for supporting seamless schema evolution in large-scale object-oriented software systems. We argue that the effectiveness of using the schema version model to materialize schema evolution relies not only on the management of version derivation of schema, but also on the ability to maintain consistency of the database instances with the new schema versions, and the flexibility of sharing instance access scopes among versions of schema. Semantics of schema versioning is studied with the objective to facilitate instance adaptation and program compatibility in the presence of schema updates. A number of options for sharing of instance access scopes among versions of a schema is...
Adaptive Schema Design and Evaluation in an Object%2DOriented Information System.

Design and Evaluation Rules for Building Adaptive Schema in an Object%2DOriented Data and Knowledge Base System.

Polymorphic Reuse Mechanisms for Object%2DOriented Database Specifications.
A polymorphic approach to the incremental design and reuse of object-oriented methods and query  specifications is presented. Using this approach, the effort required for manually reprogramming methods  and queries due to schema modifications can be avoided or minimized. The salient features of  our approach are the use of propagation patterns and a mechanism for propagation pattern refinement.  Propagation patterns can be employed as an interesting specification formalism for modeling operational  requirements in object-oriented database systems. They encourage the reuse of operational specifications  against the structural modification of an object-oriented schema. Propagation pattern refinement is  suited for the specification of reusable operational modules, and for achieving reusability of propagation  patterns towards the operational requirement changes. This approach has a formal basis and emphasizes  structural derivation of specifications. The main innovations are in raising t...
An Object%2DCentered Approach for Manipulating Hierarchically Complex Objects.

LogicBase A System Prototype for Deductive Query Evaluation.

Outline of the LogicBase Demonstration.

A Recursive Object Algebra Based on Aggregation Abstraction for Manipulating Complex Object.

Exploring Semantics in Aggregation Hierarchies for Object%2DOriented Databases.

Activity Model A Declarative Approach for Capturing Communication Behavior in Object%2DOriented Databases.

Compressed Counting Method.

Efficient Evaluation of Multiple Linear Recursions.

Processing Multiple Linear Recursions.

Application of a Method of Managing Evidential Reasoning to Decision Tree Classifier.

